./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:09:54,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:09:54,798 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 01:09:54,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:09:54,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:09:54,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:09:54,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:09:54,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:09:54,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:09:54,832 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:09:54,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:09:54,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:09:54,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:09:54,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:09:54,835 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:09:54,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:09:54,837 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:09:54,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:09:54,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:09:54,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:09:54,839 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:09:54,842 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:09:54,842 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:09:54,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:09:54,843 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:09:54,844 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:09:54,844 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:09:54,844 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:09:54,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:09:54,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:09:54,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:09:54,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:09:54,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:09:54,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:09:54,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:09:54,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:09:54,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:09:54,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:09:54,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:09:54,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:09:54,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:09:54,849 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_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/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_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2023-11-29 01:09:55,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:09:55,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:09:55,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:09:55,115 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:09:55,116 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:09:55,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-29 01:09:57,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:09:58,197 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:09:58,197 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-29 01:09:58,211 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/data/928d916ca/dd4348dfc48244c68169e3ca74295373/FLAG4774064ee [2023-11-29 01:09:58,223 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/data/928d916ca/dd4348dfc48244c68169e3ca74295373 [2023-11-29 01:09:58,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:09:58,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:09:58,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:09:58,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:09:58,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:09:58,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:09:58" (1/1) ... [2023-11-29 01:09:58,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24960c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:09:58, skipping insertion in model container [2023-11-29 01:09:58,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:09:58" (1/1) ... [2023-11-29 01:09:58,283 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:09:58,556 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:09:58,566 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:09:58,606 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:09:58,637 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:09:58,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:09:58 WrapperNode [2023-11-29 01:09:58,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:09:58,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:09:58,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:09:58,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:09:58,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:09:58" (1/1) ... [2023-11-29 01:09:58,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:09:58" (1/1) ... [2023-11-29 01:09:58,682 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2023-11-29 01:09:58,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:09:58,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:09:58,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:09:58,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:09:58,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:09:58" (1/1) ... [2023-11-29 01:09:58,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:09:58" (1/1) ... [2023-11-29 01:09:58,696 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:09:58" (1/1) ... [2023-11-29 01:09:58,715 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 13, 10]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 7, 2]. [2023-11-29 01:09:58,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:09:58" (1/1) ... [2023-11-29 01:09:58,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:09:58" (1/1) ... [2023-11-29 01:09:58,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:09:58" (1/1) ... [2023-11-29 01:09:58,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:09:58" (1/1) ... [2023-11-29 01:09:58,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:09:58" (1/1) ... [2023-11-29 01:09:58,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:09:58" (1/1) ... [2023-11-29 01:09:58,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:09:58,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:09:58,736 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:09:58,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:09:58,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:09:58" (1/1) ... [2023-11-29 01:09:58,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:09:58,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:09:58,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:09:58,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:09:58,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 01:09:58,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 01:09:58,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 01:09:58,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:09:58,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:09:58,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 01:09:58,804 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 01:09:58,804 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 01:09:58,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:09:58,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:09:58,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:09:58,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:09:58,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:09:58,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 01:09:58,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:09:58,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:09:58,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 01:09:58,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:09:58,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 01:09:58,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 01:09:58,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 01:09:58,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:09:58,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:09:58,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 01:09:58,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:09:58,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:09:58,955 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:09:58,957 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:09:59,301 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:09:59,350 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:09:59,350 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 01:09:59,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:09:59 BoogieIcfgContainer [2023-11-29 01:09:59,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:09:59,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:09:59,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:09:59,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:09:59,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:09:58" (1/3) ... [2023-11-29 01:09:59,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a285d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:09:59, skipping insertion in model container [2023-11-29 01:09:59,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:09:58" (2/3) ... [2023-11-29 01:09:59,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a285d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:09:59, skipping insertion in model container [2023-11-29 01:09:59,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:09:59" (3/3) ... [2023-11-29 01:09:59,361 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2023-11-29 01:09:59,382 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:09:59,382 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2023-11-29 01:09:59,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:09:59,438 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@77061f2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:09:59,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-11-29 01:09:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 50 states have (on average 2.32) internal successors, (116), 102 states have internal predecessors, (116), 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-29 01:09:59,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 01:09:59,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:09:59,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:09:59,450 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:09:59,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:59,456 INFO L85 PathProgramCache]: Analyzing trace with hash 233264712, now seen corresponding path program 1 times [2023-11-29 01:09:59,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:09:59,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191192978] [2023-11-29 01:09:59,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:59,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:09:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:09:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:09:59,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:09:59,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191192978] [2023-11-29 01:09:59,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191192978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:09:59,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:09:59,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:09:59,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243523190] [2023-11-29 01:09:59,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:09:59,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:09:59,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:09:59,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:09:59,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:09:59,727 INFO L87 Difference]: Start difference. First operand has 107 states, 50 states have (on average 2.32) internal successors, (116), 102 states have internal predecessors, (116), 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 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:09:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:09:59,858 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2023-11-29 01:09:59,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:09:59,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 01:09:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:09:59,870 INFO L225 Difference]: With dead ends: 104 [2023-11-29 01:09:59,870 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 01:09:59,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:09:59,875 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:09:59,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 148 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:09:59,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 01:09:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-29 01:09:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 97 states have internal predecessors, (104), 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-29 01:09:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2023-11-29 01:09:59,916 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 5 [2023-11-29 01:09:59,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:09:59,916 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2023-11-29 01:09:59,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:09:59,917 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2023-11-29 01:09:59,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 01:09:59,917 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:09:59,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:09:59,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:09:59,918 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:09:59,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash 233264713, now seen corresponding path program 1 times [2023-11-29 01:09:59,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:09:59,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265643711] [2023-11-29 01:09:59,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:59,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:09:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:10:00,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:00,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265643711] [2023-11-29 01:10:00,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265643711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:00,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:00,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:10:00,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943168732] [2023-11-29 01:10:00,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:00,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:10:00,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:00,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:10:00,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:10:00,034 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:10:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:00,135 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2023-11-29 01:10:00,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:10:00,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 01:10:00,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:00,138 INFO L225 Difference]: With dead ends: 100 [2023-11-29 01:10:00,138 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 01:10:00,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:10:00,140 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:00,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 153 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:10:00,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 01:10:00,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-29 01:10:00,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 2.125) internal successors, (102), 95 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:10:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2023-11-29 01:10:00,151 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 5 [2023-11-29 01:10:00,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:00,151 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2023-11-29 01:10:00,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:10:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2023-11-29 01:10:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 01:10:00,152 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:00,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:00,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:10:00,160 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:10:00,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:00,161 INFO L85 PathProgramCache]: Analyzing trace with hash -791732290, now seen corresponding path program 1 times [2023-11-29 01:10:00,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:00,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722244435] [2023-11-29 01:10:00,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:00,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:00,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:10:00,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:00,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722244435] [2023-11-29 01:10:00,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722244435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:00,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:00,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:10:00,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027615973] [2023-11-29 01:10:00,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:00,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:10:00,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:00,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:10:00,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:10:00,323 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 01:10:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:00,455 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2023-11-29 01:10:00,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:10:00,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-11-29 01:10:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:00,457 INFO L225 Difference]: With dead ends: 101 [2023-11-29 01:10:00,457 INFO L226 Difference]: Without dead ends: 101 [2023-11-29 01:10:00,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:10:00,459 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:00,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 213 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:10:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-29 01:10:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-29 01:10:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 96 states have internal predecessors, (103), 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-29 01:10:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2023-11-29 01:10:00,470 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 10 [2023-11-29 01:10:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:00,471 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2023-11-29 01:10:00,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 01:10:00,472 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2023-11-29 01:10:00,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 01:10:00,472 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:00,472 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:00,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:10:00,473 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:10:00,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:00,473 INFO L85 PathProgramCache]: Analyzing trace with hash 434569947, now seen corresponding path program 1 times [2023-11-29 01:10:00,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:00,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016037057] [2023-11-29 01:10:00,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:00,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:00,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:00,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:10:00,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:00,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016037057] [2023-11-29 01:10:00,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016037057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:00,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:00,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:10:00,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330388732] [2023-11-29 01:10:00,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:00,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:10:00,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:00,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:10:00,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:10:00,672 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:10:00,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:00,933 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2023-11-29 01:10:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:10:00,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-29 01:10:00,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:00,935 INFO L225 Difference]: With dead ends: 100 [2023-11-29 01:10:00,935 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 01:10:00,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:10:00,937 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 3 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:00,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 327 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:10:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 01:10:00,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-29 01:10:00,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 95 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:10:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2023-11-29 01:10:00,946 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 17 [2023-11-29 01:10:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:00,946 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2023-11-29 01:10:00,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:10:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2023-11-29 01:10:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 01:10:00,947 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:00,947 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:00,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:10:00,948 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:10:00,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:00,948 INFO L85 PathProgramCache]: Analyzing trace with hash 434569948, now seen corresponding path program 1 times [2023-11-29 01:10:00,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:00,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344523944] [2023-11-29 01:10:00,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:00,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:01,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:01,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:10:01,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:01,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344523944] [2023-11-29 01:10:01,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344523944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:01,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:01,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:10:01,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917857644] [2023-11-29 01:10:01,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:01,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:10:01,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:01,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:10:01,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:10:01,229 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:10:01,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:01,483 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2023-11-29 01:10:01,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:10:01,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-29 01:10:01,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:01,484 INFO L225 Difference]: With dead ends: 99 [2023-11-29 01:10:01,485 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 01:10:01,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:10:01,486 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:01,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 351 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:10:01,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 01:10:01,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-29 01:10:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 49 states have (on average 2.061224489795918) internal successors, (101), 94 states have internal predecessors, (101), 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-29 01:10:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2023-11-29 01:10:01,495 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 17 [2023-11-29 01:10:01,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:01,495 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2023-11-29 01:10:01,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:10:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2023-11-29 01:10:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 01:10:01,497 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:01,497 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:01,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:10:01,497 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:10:01,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:01,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1010083920, now seen corresponding path program 1 times [2023-11-29 01:10:01,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:01,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284800482] [2023-11-29 01:10:01,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:01,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:01,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:01,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 01:10:01,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:01,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284800482] [2023-11-29 01:10:01,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284800482] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:01,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856119469] [2023-11-29 01:10:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:01,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:01,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:01,779 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:01,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:10:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:01,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 01:10:01,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:01,959 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-29 01:10:02,046 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:10:02,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 01:10:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:10:02,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:10:02,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856119469] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:10:02,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:10:02,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-11-29 01:10:02,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848470066] [2023-11-29 01:10:02,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:10:02,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 01:10:02,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:02,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 01:10:02,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-29 01:10:02,403 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 01:10:02,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:02,811 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2023-11-29 01:10:02,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:10:02,812 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2023-11-29 01:10:02,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:02,813 INFO L225 Difference]: With dead ends: 98 [2023-11-29 01:10:02,813 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 01:10:02,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2023-11-29 01:10:02,814 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:02,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 569 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:10:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 01:10:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-29 01:10:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 93 states have internal predecessors, (100), 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-29 01:10:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2023-11-29 01:10:02,822 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 19 [2023-11-29 01:10:02,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:02,823 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2023-11-29 01:10:02,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 01:10:02,823 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2023-11-29 01:10:02,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 01:10:02,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:02,824 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:02,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:03,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:03,025 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:10:03,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:03,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1010083921, now seen corresponding path program 1 times [2023-11-29 01:10:03,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:03,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828365651] [2023-11-29 01:10:03,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:03,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:03,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:03,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:10:03,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:03,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828365651] [2023-11-29 01:10:03,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828365651] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:03,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747839682] [2023-11-29 01:10:03,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:03,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:03,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:03,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:03,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:10:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:03,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 01:10:03,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:03,580 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-29 01:10:03,799 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:10:03,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 01:10:03,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:10:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:10:03,866 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:04,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747839682] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:04,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:10:04,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-11-29 01:10:04,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174339055] [2023-11-29 01:10:04,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:10:04,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 01:10:04,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:04,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 01:10:04,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2023-11-29 01:10:04,017 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:10:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:04,511 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2023-11-29 01:10:04,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:10:04,511 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2023-11-29 01:10:04,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:04,512 INFO L225 Difference]: With dead ends: 99 [2023-11-29 01:10:04,512 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 01:10:04,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2023-11-29 01:10:04,514 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 5 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:04,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 476 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:10:04,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 01:10:04,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2023-11-29 01:10:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 49 states have (on average 2.020408163265306) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:10:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2023-11-29 01:10:04,521 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 19 [2023-11-29 01:10:04,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:04,521 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2023-11-29 01:10:04,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:10:04,522 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2023-11-29 01:10:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 01:10:04,523 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:04,523 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:04,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:10:04,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:04,728 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:10:04,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:04,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1861334165, now seen corresponding path program 1 times [2023-11-29 01:10:04,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:04,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231361238] [2023-11-29 01:10:04,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:04,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:05,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:05,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:05,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:10:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:05,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 01:10:05,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:05,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231361238] [2023-11-29 01:10:05,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231361238] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:05,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175837851] [2023-11-29 01:10:05,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:05,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:05,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:05,270 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:05,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 01:10:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:05,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 01:10:05,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:05,437 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-29 01:10:05,500 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:10:05,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 01:10:05,570 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:10:05,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2023-11-29 01:10:05,711 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-29 01:10:05,729 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 01:10:05,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 01:10:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2023-11-29 01:10:05,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:10:06,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175837851] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:10:06,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:10:06,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 25 [2023-11-29 01:10:06,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056937125] [2023-11-29 01:10:06,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:10:06,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 01:10:06,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:06,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 01:10:06,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=525, Unknown=1, NotChecked=48, Total=702 [2023-11-29 01:10:06,395 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 27 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-29 01:10:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:06,931 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2023-11-29 01:10:06,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:10:06,932 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 27 [2023-11-29 01:10:06,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:06,933 INFO L225 Difference]: With dead ends: 105 [2023-11-29 01:10:06,933 INFO L226 Difference]: Without dead ends: 105 [2023-11-29 01:10:06,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=648, Unknown=1, NotChecked=54, Total=870 [2023-11-29 01:10:06,934 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 186 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:06,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 374 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 568 Invalid, 0 Unknown, 109 Unchecked, 0.4s Time] [2023-11-29 01:10:06,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-29 01:10:06,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2023-11-29 01:10:06,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.836734693877551) internal successors, (90), 83 states have internal predecessors, (90), 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-29 01:10:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-11-29 01:10:06,940 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 27 [2023-11-29 01:10:06,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:06,941 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-11-29 01:10:06,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-29 01:10:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-11-29 01:10:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 01:10:06,942 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:06,942 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:06,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:07,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:07,152 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:10:07,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:07,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1861334164, now seen corresponding path program 1 times [2023-11-29 01:10:07,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:07,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81540014] [2023-11-29 01:10:07,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:07,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:07,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:07,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:07,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:10:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 01:10:07,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:07,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81540014] [2023-11-29 01:10:07,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81540014] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:07,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136599337] [2023-11-29 01:10:07,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:07,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:07,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:07,741 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:07,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 01:10:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:07,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 01:10:07,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:07,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 01:10:07,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:10:07,954 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-29 01:10:07,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:10:07,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:10:08,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:10:08,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:10:08,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:10:08,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:10:08,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:10:08,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:10:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 01:10:08,118 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:10:08,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136599337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:08,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:10:08,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2023-11-29 01:10:08,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109517107] [2023-11-29 01:10:08,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:08,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:10:08,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:08,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:10:08,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2023-11-29 01:10:08,120 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:10:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:08,252 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2023-11-29 01:10:08,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:10:08,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-11-29 01:10:08,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:08,254 INFO L225 Difference]: With dead ends: 82 [2023-11-29 01:10:08,254 INFO L226 Difference]: Without dead ends: 82 [2023-11-29 01:10:08,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2023-11-29 01:10:08,255 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 26 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:08,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 187 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 111 Unchecked, 0.1s Time] [2023-11-29 01:10:08,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-29 01:10:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-29 01:10:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 77 states have internal predecessors, (84), 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-29 01:10:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2023-11-29 01:10:08,260 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 27 [2023-11-29 01:10:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:08,261 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2023-11-29 01:10:08,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:10:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2023-11-29 01:10:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 01:10:08,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:08,262 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:08,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 01:10:08,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-29 01:10:08,469 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:10:08,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:08,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1316655134, now seen corresponding path program 1 times [2023-11-29 01:10:08,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:08,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382108459] [2023-11-29 01:10:08,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:08,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:08,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:08,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:08,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:10:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 01:10:08,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:08,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382108459] [2023-11-29 01:10:08,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382108459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:08,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:08,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:10:08,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582724769] [2023-11-29 01:10:08,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:08,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:10:08,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:08,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:10:08,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:10:08,623 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 01:10:08,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:08,805 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2023-11-29 01:10:08,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:10:08,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-11-29 01:10:08,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:08,807 INFO L225 Difference]: With dead ends: 80 [2023-11-29 01:10:08,807 INFO L226 Difference]: Without dead ends: 80 [2023-11-29 01:10:08,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:10:08,808 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 22 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:08,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 251 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:10:08,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-29 01:10:08,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-29 01:10:08,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 75 states have internal predecessors, (82), 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-29 01:10:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-11-29 01:10:08,812 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 30 [2023-11-29 01:10:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:08,813 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-11-29 01:10:08,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 01:10:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-11-29 01:10:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 01:10:08,814 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:08,814 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:08,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:10:08,814 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:10:08,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:08,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1316655135, now seen corresponding path program 1 times [2023-11-29 01:10:08,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:08,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688829519] [2023-11-29 01:10:08,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:08,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:08,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:08,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:09,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:10:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 01:10:09,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:09,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688829519] [2023-11-29 01:10:09,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688829519] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:09,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652757807] [2023-11-29 01:10:09,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:09,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:09,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:09,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:09,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 01:10:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:09,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 01:10:09,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 01:10:09,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:10:09,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652757807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:09,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:10:09,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2023-11-29 01:10:09,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713117815] [2023-11-29 01:10:09,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:09,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:10:09,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:09,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:10:09,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2023-11-29 01:10:09,327 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 01:10:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:09,465 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2023-11-29 01:10:09,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:10:09,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-11-29 01:10:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:09,466 INFO L225 Difference]: With dead ends: 78 [2023-11-29 01:10:09,466 INFO L226 Difference]: Without dead ends: 78 [2023-11-29 01:10:09,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-11-29 01:10:09,467 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 19 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:09,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 246 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:10:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-29 01:10:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-29 01:10:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 73 states have internal predecessors, (80), 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-29 01:10:09,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2023-11-29 01:10:09,471 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 30 [2023-11-29 01:10:09,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:09,472 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2023-11-29 01:10:09,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 01:10:09,472 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2023-11-29 01:10:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 01:10:09,473 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:09,473 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:09,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 01:10:09,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 01:10:09,680 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:10:09,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:09,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1316668384, now seen corresponding path program 1 times [2023-11-29 01:10:09,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:09,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928866344] [2023-11-29 01:10:09,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:09,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:09,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:09,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:09,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:10:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 01:10:10,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:10,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928866344] [2023-11-29 01:10:10,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928866344] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:10,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415271640] [2023-11-29 01:10:10,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:10,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:10,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:10,044 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:10,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 01:10:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:10,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 01:10:10,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:10,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:10:10,312 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-29 01:10:10,349 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-29 01:10:10,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2023-11-29 01:10:10,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 01:10:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 01:10:10,370 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:10:10,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415271640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:10,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:10:10,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2023-11-29 01:10:10,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573526053] [2023-11-29 01:10:10,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:10,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:10:10,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:10,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:10:10,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=205, Unknown=1, NotChecked=28, Total=272 [2023-11-29 01:10:10,372 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:10:10,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:10,523 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2023-11-29 01:10:10,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:10:10,523 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2023-11-29 01:10:10,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:10,525 INFO L225 Difference]: With dead ends: 79 [2023-11-29 01:10:10,525 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 01:10:10,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=261, Unknown=1, NotChecked=32, Total=342 [2023-11-29 01:10:10,526 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 26 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:10,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 252 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 184 Invalid, 0 Unknown, 119 Unchecked, 0.1s Time] [2023-11-29 01:10:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 01:10:10,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2023-11-29 01:10:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 72 states have internal predecessors, (80), 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-29 01:10:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-11-29 01:10:10,530 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 30 [2023-11-29 01:10:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:10,530 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-11-29 01:10:10,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:10:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-11-29 01:10:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 01:10:10,532 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:10,532 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:10,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 01:10:10,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 01:10:10,736 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:10:10,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:10,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1316668385, now seen corresponding path program 1 times [2023-11-29 01:10:10,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:10,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770169098] [2023-11-29 01:10:10,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:10,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:11,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:11,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:11,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:10:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:10:11,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:11,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770169098] [2023-11-29 01:10:11,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770169098] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:11,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883019737] [2023-11-29 01:10:11,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:11,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:11,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:11,290 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:11,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 01:10:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:11,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-29 01:10:11,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:11,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 01:10:11,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:10:11,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:10:11,686 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 01:10:11,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:10:11,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-29 01:10:11,733 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 01:10:11,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 01:10:11,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 01:10:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-29 01:10:11,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:11,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883019737] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:11,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:10:11,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2023-11-29 01:10:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472840135] [2023-11-29 01:10:11,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:10:11,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 01:10:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:11,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 01:10:11,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=538, Unknown=1, NotChecked=46, Total=650 [2023-11-29 01:10:11,992 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 23 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 01:10:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:12,736 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2023-11-29 01:10:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 01:10:12,736 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-11-29 01:10:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:12,738 INFO L225 Difference]: With dead ends: 92 [2023-11-29 01:10:12,738 INFO L226 Difference]: Without dead ends: 92 [2023-11-29 01:10:12,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=1321, Unknown=1, NotChecked=74, Total=1560 [2023-11-29 01:10:12,739 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 131 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:12,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 668 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 722 Invalid, 0 Unknown, 97 Unchecked, 0.4s Time] [2023-11-29 01:10:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-29 01:10:12,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2023-11-29 01:10:12,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 83 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:10:12,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2023-11-29 01:10:12,744 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 30 [2023-11-29 01:10:12,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:12,744 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2023-11-29 01:10:12,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 01:10:12,745 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2023-11-29 01:10:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 01:10:12,745 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:12,745 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:12,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:12,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:12,946 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:10:12,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:12,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1709766752, now seen corresponding path program 1 times [2023-11-29 01:10:12,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:12,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880453405] [2023-11-29 01:10:12,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:12,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:10:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 01:10:13,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:13,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880453405] [2023-11-29 01:10:13,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880453405] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:13,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028976028] [2023-11-29 01:10:13,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:13,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:13,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:13,222 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:13,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 01:10:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 01:10:13,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:13,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 01:10:13,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:10:13,506 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-29 01:10:13,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:10:13,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:10:13,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:10:13,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:10:13,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:10:13,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:10:13,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:10:13,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:10:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 01:10:13,702 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:10:13,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028976028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:13,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:10:13,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 14 [2023-11-29 01:10:13,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17944045] [2023-11-29 01:10:13,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:13,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:10:13,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:13,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:10:13,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=132, Unknown=1, NotChecked=22, Total=182 [2023-11-29 01:10:13,705 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 01:10:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:13,784 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2023-11-29 01:10:13,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:10:13,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2023-11-29 01:10:13,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:13,785 INFO L225 Difference]: With dead ends: 86 [2023-11-29 01:10:13,786 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 01:10:13,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=132, Unknown=1, NotChecked=22, Total=182 [2023-11-29 01:10:13,787 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 55 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:13,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 119 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 94 Unchecked, 0.1s Time] [2023-11-29 01:10:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 01:10:13,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-29 01:10:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 80 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:10:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-11-29 01:10:13,791 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 32 [2023-11-29 01:10:13,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:13,791 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-11-29 01:10:13,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 01:10:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-11-29 01:10:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 01:10:13,792 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:13,793 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:13,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:13,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 01:10:13,996 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:10:13,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1463157820, now seen corresponding path program 1 times [2023-11-29 01:10:13,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:13,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117983798] [2023-11-29 01:10:13,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:13,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:10:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 01:10:14,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:14,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117983798] [2023-11-29 01:10:14,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117983798] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:14,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927479269] [2023-11-29 01:10:14,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:14,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:14,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:14,252 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:14,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 01:10:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 01:10:14,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:14,620 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-29 01:10:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:10:14,639 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:14,671 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 8 treesize of output 4 [2023-11-29 01:10:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 01:10:14,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927479269] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:10:14,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:10:14,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 18 [2023-11-29 01:10:14,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367603] [2023-11-29 01:10:14,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:10:14,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 01:10:14,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:14,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 01:10:14,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2023-11-29 01:10:14,699 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 15 states have internal predecessors, (42), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 01:10:18,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:10:22,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:10:26,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:10:30,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:10:34,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:10:38,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:10:42,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:10:47,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:10:47,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:47,048 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2023-11-29 01:10:47,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 01:10:47,049 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 15 states have internal predecessors, (42), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 33 [2023-11-29 01:10:47,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:47,049 INFO L225 Difference]: With dead ends: 87 [2023-11-29 01:10:47,049 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 01:10:47,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2023-11-29 01:10:47,050 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 101 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:47,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 661 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 8 Unknown, 0 Unchecked, 32.2s Time] [2023-11-29 01:10:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 01:10:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2023-11-29 01:10:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 78 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:10:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2023-11-29 01:10:47,054 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 33 [2023-11-29 01:10:47,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:47,054 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2023-11-29 01:10:47,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 15 states have internal predecessors, (42), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 01:10:47,055 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2023-11-29 01:10:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 01:10:47,055 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:47,056 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:47,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 01:10:47,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:47,256 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:10:47,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:47,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1237464813, now seen corresponding path program 1 times [2023-11-29 01:10:47,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:47,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093252002] [2023-11-29 01:10:47,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:47,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:47,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:47,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:47,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:10:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:47,988 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:10:47,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:47,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093252002] [2023-11-29 01:10:47,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093252002] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:47,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31958339] [2023-11-29 01:10:47,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:47,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:47,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:47,990 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:47,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 01:10:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:48,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 83 conjunts are in the unsatisfiable core [2023-11-29 01:10:48,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:48,187 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-29 01:10:48,371 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:10:48,372 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-29 01:10:48,459 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-29 01:10:48,538 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 01:10:48,539 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-29 01:10:48,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-29 01:10:48,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:10:48,758 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_8|) 0) 0))) is different from true [2023-11-29 01:10:48,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:10:48,770 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-29 01:10:48,800 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-11-29 01:10:48,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2023-11-29 01:10:48,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 38 [2023-11-29 01:10:49,093 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 33 treesize of output 17 [2023-11-29 01:10:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 01:10:49,163 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:49,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31958339] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:49,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:10:49,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2023-11-29 01:10:49,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704462884] [2023-11-29 01:10:49,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:10:49,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 01:10:49,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:49,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 01:10:49,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1206, Unknown=1, NotChecked=70, Total=1406 [2023-11-29 01:10:49,268 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 37 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 30 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:10:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:50,404 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2023-11-29 01:10:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 01:10:50,404 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 30 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-11-29 01:10:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:50,405 INFO L225 Difference]: With dead ends: 124 [2023-11-29 01:10:50,405 INFO L226 Difference]: Without dead ends: 124 [2023-11-29 01:10:50,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=261, Invalid=2192, Unknown=1, NotChecked=96, Total=2550 [2023-11-29 01:10:50,407 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 139 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:50,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 781 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1062 Invalid, 0 Unknown, 120 Unchecked, 0.7s Time] [2023-11-29 01:10:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-29 01:10:50,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 104. [2023-11-29 01:10:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.381578947368421) internal successors, (105), 95 states have internal predecessors, (105), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:10:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2023-11-29 01:10:50,412 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 34 [2023-11-29 01:10:50,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:50,413 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2023-11-29 01:10:50,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 30 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:10:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2023-11-29 01:10:50,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 01:10:50,414 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:50,414 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:50,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 01:10:50,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:50,615 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:10:50,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:50,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1237464814, now seen corresponding path program 1 times [2023-11-29 01:10:50,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:50,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955756692] [2023-11-29 01:10:50,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:50,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:51,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:51,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:51,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:10:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:10:52,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:52,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955756692] [2023-11-29 01:10:52,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955756692] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:52,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270387827] [2023-11-29 01:10:52,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:52,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:52,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:52,245 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:52,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 01:10:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:52,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 01:10:52,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:52,462 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-29 01:10:52,747 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:10:52,747 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-29 01:10:52,883 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-29 01:10:52,890 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-29 01:10:53,003 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 01:10:53,003 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 91 treesize of output 60 [2023-11-29 01:10:53,009 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-29 01:10:53,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2023-11-29 01:10:53,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:10:53,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 01:10:53,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:10:53,337 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_9|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from true [2023-11-29 01:10:53,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:10:53,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2023-11-29 01:10:53,377 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 01:10:53,378 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-29 01:10:53,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-29 01:10:53,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 01:10:53,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2023-11-29 01:10:53,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:10:53,678 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-29 01:10:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 01:10:53,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:54,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270387827] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:54,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:10:54,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 43 [2023-11-29 01:10:54,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355999298] [2023-11-29 01:10:54,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:10:54,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-29 01:10:54,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:54,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-29 01:10:54,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2113, Unknown=1, NotChecked=92, Total=2352 [2023-11-29 01:10:54,211 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 44 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 37 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:10:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:56,475 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2023-11-29 01:10:56,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 01:10:56,476 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 37 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-11-29 01:10:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:56,476 INFO L225 Difference]: With dead ends: 127 [2023-11-29 01:10:56,477 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 01:10:56,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=384, Invalid=4175, Unknown=1, NotChecked=132, Total=4692 [2023-11-29 01:10:56,478 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 208 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:56,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1207 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1763 Invalid, 0 Unknown, 126 Unchecked, 1.2s Time] [2023-11-29 01:10:56,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 01:10:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 103. [2023-11-29 01:10:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 94 states have internal predecessors, (103), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:10:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2023-11-29 01:10:56,482 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 34 [2023-11-29 01:10:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:56,482 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2023-11-29 01:10:56,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 37 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:10:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2023-11-29 01:10:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 01:10:56,483 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:56,483 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:56,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 01:10:56,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:56,684 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:10:56,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:56,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1630577798, now seen corresponding path program 2 times [2023-11-29 01:10:56,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:56,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713277026] [2023-11-29 01:10:56,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:56,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:57,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:57,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:57,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:10:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:10:57,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:57,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713277026] [2023-11-29 01:10:57,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713277026] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:57,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120254252] [2023-11-29 01:10:57,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:10:57,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:57,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:57,827 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:57,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 01:10:58,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:10:58,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:10:58,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-29 01:10:58,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:58,041 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-29 01:10:58,290 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:10:58,291 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-29 01:10:58,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:10:58,433 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-29 01:10:58,540 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-29 01:10:58,540 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 85 treesize of output 47 [2023-11-29 01:10:58,550 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-29 01:10:58,632 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 01:10:58,632 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 49 treesize of output 24 [2023-11-29 01:10:58,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:10:58,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 01:10:58,836 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from true [2023-11-29 01:10:58,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:10:58,860 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 01:10:58,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 46 [2023-11-29 01:10:58,880 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 01:10:58,880 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-29 01:10:58,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 01:10:59,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2023-11-29 01:10:59,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:10:59,443 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:10:59,443 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 31 treesize of output 14 [2023-11-29 01:10:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 01:10:59,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:59,670 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2023-11-29 01:10:59,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2023-11-29 01:10:59,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120254252] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:59,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:10:59,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 45 [2023-11-29 01:10:59,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882766264] [2023-11-29 01:10:59,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:10:59,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-29 01:10:59,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:59,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-29 01:10:59,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2290, Unknown=1, NotChecked=96, Total=2550 [2023-11-29 01:10:59,984 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 45 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 38 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:11:01,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:01,907 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2023-11-29 01:11:01,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 01:11:01,907 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 38 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-11-29 01:11:01,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:11:01,908 INFO L225 Difference]: With dead ends: 113 [2023-11-29 01:11:01,909 INFO L226 Difference]: Without dead ends: 113 [2023-11-29 01:11:01,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=379, Invalid=3784, Unknown=1, NotChecked=126, Total=4290 [2023-11-29 01:11:01,911 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 181 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:11:01,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1072 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1276 Invalid, 0 Unknown, 110 Unchecked, 0.9s Time] [2023-11-29 01:11:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-29 01:11:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2023-11-29 01:11:01,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.358974358974359) internal successors, (106), 97 states have internal predecessors, (106), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:11:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2023-11-29 01:11:01,916 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 38 [2023-11-29 01:11:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:11:01,917 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2023-11-29 01:11:01,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 38 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:11:01,917 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2023-11-29 01:11:01,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 01:11:01,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:11:01,918 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:01,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 01:11:02,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:02,126 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:11:02,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:02,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1612769321, now seen corresponding path program 1 times [2023-11-29 01:11:02,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:02,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594354622] [2023-11-29 01:11:02,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:02,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:02,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:11:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:02,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:11:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:02,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:11:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:02,494 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 01:11:02,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:02,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594354622] [2023-11-29 01:11:02,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594354622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:11:02,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:11:02,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:11:02,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342765314] [2023-11-29 01:11:02,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:11:02,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:11:02,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:02,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:11:02,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:11:02,496 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 10 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:11:02,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:02,725 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2023-11-29 01:11:02,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:11:02,725 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2023-11-29 01:11:02,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:11:02,727 INFO L225 Difference]: With dead ends: 115 [2023-11-29 01:11:02,727 INFO L226 Difference]: Without dead ends: 115 [2023-11-29 01:11:02,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:11:02,727 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 75 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:11:02,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 243 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:11:02,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-29 01:11:02,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2023-11-29 01:11:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.382716049382716) internal successors, (112), 100 states have internal predecessors, (112), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:11:02,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2023-11-29 01:11:02,731 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 39 [2023-11-29 01:11:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:11:02,732 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2023-11-29 01:11:02,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:11:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2023-11-29 01:11:02,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 01:11:02,732 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:11:02,732 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:02,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 01:11:02,733 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:11:02,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:02,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1612769320, now seen corresponding path program 1 times [2023-11-29 01:11:02,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:02,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149834194] [2023-11-29 01:11:02,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:02,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:02,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:11:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:02,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:11:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:02,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:11:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 01:11:02,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:02,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149834194] [2023-11-29 01:11:02,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149834194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:11:02,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:11:02,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:11:02,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109470993] [2023-11-29 01:11:02,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:11:02,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:11:02,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:02,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:11:02,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:11:02,950 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:11:03,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:03,123 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2023-11-29 01:11:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:11:03,123 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2023-11-29 01:11:03,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:11:03,124 INFO L225 Difference]: With dead ends: 129 [2023-11-29 01:11:03,124 INFO L226 Difference]: Without dead ends: 129 [2023-11-29 01:11:03,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:11:03,125 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 67 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:11:03,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 243 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:11:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-29 01:11:03,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2023-11-29 01:11:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.345679012345679) internal successors, (109), 99 states have internal predecessors, (109), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:11:03,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2023-11-29 01:11:03,129 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 39 [2023-11-29 01:11:03,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:11:03,129 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2023-11-29 01:11:03,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:11:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2023-11-29 01:11:03,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 01:11:03,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:11:03,130 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:03,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 01:11:03,131 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:11:03,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:03,131 INFO L85 PathProgramCache]: Analyzing trace with hash 580626815, now seen corresponding path program 3 times [2023-11-29 01:11:03,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:03,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421160814] [2023-11-29 01:11:03,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:03,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:03,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:11:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:03,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:11:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:03,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:11:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:03,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 01:11:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-29 01:11:03,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:03,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421160814] [2023-11-29 01:11:03,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421160814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:11:03,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:11:03,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:11:03,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067238514] [2023-11-29 01:11:03,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:11:03,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:11:03,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:03,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:11:03,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:11:03,242 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 01:11:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:03,304 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2023-11-29 01:11:03,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:11:03,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2023-11-29 01:11:03,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:11:03,305 INFO L225 Difference]: With dead ends: 77 [2023-11-29 01:11:03,305 INFO L226 Difference]: Without dead ends: 77 [2023-11-29 01:11:03,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:11:03,306 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:11:03,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 142 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:11:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-29 01:11:03,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-29 01:11:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 71 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:11:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-11-29 01:11:03,309 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 43 [2023-11-29 01:11:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:11:03,309 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-11-29 01:11:03,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 01:11:03,310 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-11-29 01:11:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 01:11:03,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:11:03,310 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:03,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 01:11:03,310 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:11:03,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:03,311 INFO L85 PathProgramCache]: Analyzing trace with hash 398591436, now seen corresponding path program 1 times [2023-11-29 01:11:03,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:03,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922014900] [2023-11-29 01:11:03,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:03,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:03,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:11:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:03,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:11:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:03,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:11:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:11:04,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:04,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922014900] [2023-11-29 01:11:04,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922014900] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:11:04,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231257046] [2023-11-29 01:11:04,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:04,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:04,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:04,122 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:04,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 01:11:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:04,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 79 conjunts are in the unsatisfiable core [2023-11-29 01:11:04,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:04,368 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-29 01:11:04,531 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:11:04,531 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-29 01:11:04,613 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-29 01:11:04,688 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 01:11:04,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-29 01:11:04,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-29 01:11:04,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:11:04,873 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_11|) 0) 0))) is different from true [2023-11-29 01:11:04,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:11:04,887 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-29 01:11:04,903 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 01:11:04,903 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-29 01:11:04,983 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:11:04,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:11:05,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-11-29 01:11:05,066 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-29 01:11:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 01:11:05,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:05,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231257046] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:11:05,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:05,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 39 [2023-11-29 01:11:05,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074661572] [2023-11-29 01:11:05,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:05,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 01:11:05,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:05,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 01:11:05,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1590, Unknown=1, NotChecked=80, Total=1806 [2023-11-29 01:11:05,285 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 39 states, 31 states have (on average 2.0) internal successors, (62), 32 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:11:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:06,150 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2023-11-29 01:11:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 01:11:06,151 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 2.0) internal successors, (62), 32 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 43 [2023-11-29 01:11:06,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:11:06,152 INFO L225 Difference]: With dead ends: 77 [2023-11-29 01:11:06,152 INFO L226 Difference]: Without dead ends: 77 [2023-11-29 01:11:06,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=269, Invalid=2490, Unknown=1, NotChecked=102, Total=2862 [2023-11-29 01:11:06,154 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 100 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:11:06,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 801 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 794 Invalid, 0 Unknown, 77 Unchecked, 0.5s Time] [2023-11-29 01:11:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-29 01:11:06,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-29 01:11:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:11:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2023-11-29 01:11:06,157 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 43 [2023-11-29 01:11:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:11:06,157 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2023-11-29 01:11:06,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 2.0) internal successors, (62), 32 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:11:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2023-11-29 01:11:06,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 01:11:06,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:11:06,158 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:06,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 01:11:06,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:06,358 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:11:06,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:06,359 INFO L85 PathProgramCache]: Analyzing trace with hash 28356575, now seen corresponding path program 1 times [2023-11-29 01:11:06,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:06,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567820727] [2023-11-29 01:11:06,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:06,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:07,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:11:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:07,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:11:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:11:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:08,046 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:11:08,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:08,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567820727] [2023-11-29 01:11:08,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567820727] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:11:08,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992043780] [2023-11-29 01:11:08,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:08,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:08,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:08,049 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:08,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 01:11:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:08,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 01:11:08,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:08,395 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-29 01:11:08,567 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:11:08,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 01:11:08,661 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-29 01:11:08,747 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-29 01:11:08,748 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-29 01:11:08,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2023-11-29 01:11:08,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:11:08,976 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-29 01:11:09,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:11:09,081 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-29 01:11:09,097 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-29 01:11:09,097 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-29 01:11:09,590 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:11:09,594 INFO L349 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2023-11-29 01:11:09,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 19 [2023-11-29 01:11:09,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:11:09,817 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 25 treesize of output 13 [2023-11-29 01:11:09,977 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 13 [2023-11-29 01:11:09,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:11:10,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 22 treesize of output 17 [2023-11-29 01:11:10,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-29 01:11:10,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 22 treesize of output 10 [2023-11-29 01:11:10,263 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:11:10,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:11:10,265 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 19 treesize of output 10 [2023-11-29 01:11:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:11:10,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:11,045 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset_31| Int)) (or (< |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset_31|) (not (= v_ArrVal_2911 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset_31| (select v_ArrVal_2911 |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset_31|)))) (< |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset_31| 0) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_2911) (select (select |c_#memory_$Pointer$#1.base| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2915) (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_#t~ret9#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 .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset_31|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2023-11-29 01:11:11,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:11:11,157 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 268 treesize of output 272 [2023-11-29 01:11:11,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 206 [2023-11-29 01:11:11,231 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 493 treesize of output 445 [2023-11-29 01:11:11,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992043780] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:11:11,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:11,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 47 [2023-11-29 01:11:11,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868631604] [2023-11-29 01:11:11,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:11,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-29 01:11:11,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:11,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-29 01:11:11,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2771, Unknown=28, NotChecked=106, Total=3080 [2023-11-29 01:11:11,588 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 47 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:11:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:12,861 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2023-11-29 01:11:12,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 01:11:12,862 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2023-11-29 01:11:12,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:11:12,862 INFO L225 Difference]: With dead ends: 77 [2023-11-29 01:11:12,862 INFO L226 Difference]: Without dead ends: 77 [2023-11-29 01:11:12,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=284, Invalid=4114, Unknown=28, NotChecked=130, Total=4556 [2023-11-29 01:11:12,864 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 151 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:11:12,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 963 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:11:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-29 01:11:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-29 01:11:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 71 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:11:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2023-11-29 01:11:12,867 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 47 [2023-11-29 01:11:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:11:12,867 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2023-11-29 01:11:12,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:11:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2023-11-29 01:11:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-29 01:11:12,868 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:11:12,868 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:12,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 01:11:13,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:13,068 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:11:13,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:13,069 INFO L85 PathProgramCache]: Analyzing trace with hash 882087891, now seen corresponding path program 1 times [2023-11-29 01:11:13,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:13,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177941393] [2023-11-29 01:11:13,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:14,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:11:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:14,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:11:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:14,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:11:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:11:14,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:14,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177941393] [2023-11-29 01:11:14,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177941393] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:11:14,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653239304] [2023-11-29 01:11:14,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:14,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:14,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,000 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 01:11:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:15,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-29 01:11:15,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:15,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 01:11:15,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:11:15,748 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 01:11:15,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-29 01:11:16,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 01:11:16,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 01:11:16,367 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 40 treesize of output 24 [2023-11-29 01:11:16,388 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 01:11:16,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 01:11:16,508 INFO L349 Elim1Store]: treesize reduction 29, result has 44.2 percent of original size [2023-11-29 01:11:16,509 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 45 treesize of output 48 [2023-11-29 01:11:16,522 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2023-11-29 01:11:16,522 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 23 treesize of output 22 [2023-11-29 01:11:16,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:11:16,888 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 60 treesize of output 48 [2023-11-29 01:11:16,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:11:16,898 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 40 treesize of output 44 [2023-11-29 01:11:17,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-29 01:11:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 01:11:17,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:18,858 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 1597 treesize of output 1485 [2023-11-29 01:11:18,881 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 3739 treesize of output 3403 [2023-11-29 01:11:19,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:11:19,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:11:19,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:11:19,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:11:19,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:11:19,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:11:19,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:11:19,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:11:19,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:11:19,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:11:20,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653239304] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:11:20,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:20,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21] total 46 [2023-11-29 01:11:20,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750961849] [2023-11-29 01:11:20,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:20,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-29 01:11:20,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:20,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-29 01:11:20,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3117, Unknown=0, NotChecked=0, Total=3306 [2023-11-29 01:11:20,968 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 40 states have internal predecessors, (81), 5 states have call successors, (6), 3 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-29 01:11:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:24,483 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2023-11-29 01:11:24,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 01:11:24,483 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 40 states have internal predecessors, (81), 5 states have call successors, (6), 3 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 48 [2023-11-29 01:11:24,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:11:24,484 INFO L225 Difference]: With dead ends: 112 [2023-11-29 01:11:24,484 INFO L226 Difference]: Without dead ends: 112 [2023-11-29 01:11:24,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=442, Invalid=6530, Unknown=0, NotChecked=0, Total=6972 [2023-11-29 01:11:24,488 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 365 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:11:24,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1259 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 01:11:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-29 01:11:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 82. [2023-11-29 01:11:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:11:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2023-11-29 01:11:24,492 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 48 [2023-11-29 01:11:24,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:11:24,492 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2023-11-29 01:11:24,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 40 states have internal predecessors, (81), 5 states have call successors, (6), 3 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-29 01:11:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2023-11-29 01:11:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-29 01:11:24,493 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:11:24,493 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:24,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 01:11:24,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:24,694 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:11:24,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:24,694 INFO L85 PathProgramCache]: Analyzing trace with hash 882087890, now seen corresponding path program 1 times [2023-11-29 01:11:24,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:24,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494923275] [2023-11-29 01:11:24,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:24,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:25,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:11:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:25,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:11:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:25,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:11:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:11:26,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:26,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494923275] [2023-11-29 01:11:26,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494923275] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:11:26,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018700956] [2023-11-29 01:11:26,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:26,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:26,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:26,096 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:26,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 01:11:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:26,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-29 01:11:26,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:26,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 01:11:26,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:11:26,633 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 36 treesize of output 24 [2023-11-29 01:11:26,698 INFO L349 Elim1Store]: treesize reduction 37, result has 45.6 percent of original size [2023-11-29 01:11:26,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 48 [2023-11-29 01:11:26,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 48 [2023-11-29 01:11:26,816 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 47 treesize of output 35 [2023-11-29 01:11:26,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:11:26,930 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 39 treesize of output 35 [2023-11-29 01:11:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 01:11:26,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:27,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2023-11-29 01:11:42,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:11:42,694 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 495 treesize of output 455 [2023-11-29 01:11:42,781 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 162 treesize of output 146 [2023-11-29 01:11:42,813 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 162 treesize of output 146 [2023-11-29 01:11:42,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:11:43,392 INFO L349 Elim1Store]: treesize reduction 8, result has 94.3 percent of original size [2023-11-29 01:11:43,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 196 [2023-11-29 01:11:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 01:11:49,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018700956] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:11:49,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:11:49,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11, 10] total 42 [2023-11-29 01:11:49,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374808645] [2023-11-29 01:11:49,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:49,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-29 01:11:49,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:49,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-29 01:11:49,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1665, Unknown=4, NotChecked=0, Total=1806 [2023-11-29 01:11:49,288 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 43 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 39 states have internal predecessors, (91), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-29 01:11:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:51,039 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2023-11-29 01:11:51,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 01:11:51,039 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 39 states have internal predecessors, (91), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 48 [2023-11-29 01:11:51,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:11:51,040 INFO L225 Difference]: With dead ends: 126 [2023-11-29 01:11:51,040 INFO L226 Difference]: Without dead ends: 126 [2023-11-29 01:11:51,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=308, Invalid=3594, Unknown=4, NotChecked=0, Total=3906 [2023-11-29 01:11:51,042 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 198 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:11:51,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 681 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 01:11:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-29 01:11:51,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 82. [2023-11-29 01:11:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 76 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:11:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-11-29 01:11:51,045 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 48 [2023-11-29 01:11:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:11:51,046 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-11-29 01:11:51,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 39 states have internal predecessors, (91), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-29 01:11:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-11-29 01:11:51,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 01:11:51,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:11:51,047 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:51,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 01:11:51,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 01:11:51,248 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:11:51,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:51,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1669477787, now seen corresponding path program 1 times [2023-11-29 01:11:51,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:51,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322694661] [2023-11-29 01:11:51,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:51,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:52,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:11:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:52,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:11:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:52,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:11:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:11:52,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:52,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322694661] [2023-11-29 01:11:52,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322694661] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:11:52,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935380565] [2023-11-29 01:11:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:52,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:52,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:52,620 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:52,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 01:11:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:52,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 106 conjunts are in the unsatisfiable core [2023-11-29 01:11:52,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:52,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:11:53,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:11:53,311 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-29 01:11:53,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 01:11:53,468 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 01:11:53,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 01:11:53,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 01:11:54,534 INFO L349 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2023-11-29 01:11:54,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 38 [2023-11-29 01:11:54,702 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2023-11-29 01:11:54,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 53 [2023-11-29 01:11:54,729 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 01:11:54,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 01:11:54,882 INFO L349 Elim1Store]: treesize reduction 57, result has 16.2 percent of original size [2023-11-29 01:11:54,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 38 [2023-11-29 01:11:55,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:11:55,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:11:55,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 89 [2023-11-29 01:11:55,383 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-29 01:11:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:11:55,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:56,526 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 97 treesize of output 89 [2023-11-29 01:12:03,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:12:03,608 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 717 treesize of output 720 [2023-11-29 01:12:04,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935380565] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:12:04,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:12:04,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 52 [2023-11-29 01:12:04,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142965307] [2023-11-29 01:12:04,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:12:04,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-29 01:12:04,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:12:04,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-29 01:12:04,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3689, Unknown=1, NotChecked=0, Total=3906 [2023-11-29 01:12:04,292 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 52 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 5 states have call successors, (6), 3 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-29 01:12:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:12:07,816 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2023-11-29 01:12:07,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-29 01:12:07,817 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 5 states have call successors, (6), 3 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 51 [2023-11-29 01:12:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:12:07,817 INFO L225 Difference]: With dead ends: 86 [2023-11-29 01:12:07,818 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 01:12:07,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1554 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=572, Invalid=7799, Unknown=1, NotChecked=0, Total=8372 [2023-11-29 01:12:07,820 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 151 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:12:07,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1186 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 01:12:07,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 01:12:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2023-11-29 01:12:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:12:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2023-11-29 01:12:07,823 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 51 [2023-11-29 01:12:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:12:07,824 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2023-11-29 01:12:07,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 5 states have call successors, (6), 3 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-29 01:12:07,824 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2023-11-29 01:12:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 01:12:07,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:12:07,825 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:12:07,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 01:12:08,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:08,025 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:12:08,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:12:08,026 INFO L85 PathProgramCache]: Analyzing trace with hash 245420150, now seen corresponding path program 1 times [2023-11-29 01:12:08,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:12:08,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315864237] [2023-11-29 01:12:08,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:08,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:12:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:09,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:12:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:09,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:12:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:10,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:12:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:12:10,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:12:10,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315864237] [2023-11-29 01:12:10,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315864237] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:12:10,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879171079] [2023-11-29 01:12:10,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:10,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:10,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:12:10,430 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:12:10,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 01:12:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:10,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 162 conjunts are in the unsatisfiable core [2023-11-29 01:12:10,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:12:10,729 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-29 01:12:10,958 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-29 01:12:11,056 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:12:11,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 01:12:11,242 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 23 treesize of output 11 [2023-11-29 01:12:11,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:12:11,384 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 01:12:11,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 53 [2023-11-29 01:12:11,393 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 36 treesize of output 15 [2023-11-29 01:12:11,489 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 30 treesize of output 14 [2023-11-29 01:12:11,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 01:12:11,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:12:11,974 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 01:12:11,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-29 01:12:12,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:12:12,007 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 48 treesize of output 32 [2023-11-29 01:12:12,029 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 01:12:12,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 01:12:14,057 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:12:14,057 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:12:14,068 INFO L349 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2023-11-29 01:12:14,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 59 [2023-11-29 01:12:14,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 01:12:14,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 01:12:14,378 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-29 01:12:14,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 64 [2023-11-29 01:12:14,405 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 01:12:14,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 01:12:14,569 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2023-11-29 01:12:14,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 214 treesize of output 107 [2023-11-29 01:12:14,576 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 48 treesize of output 19 [2023-11-29 01:12:14,583 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 63 treesize of output 15 [2023-11-29 01:12:14,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2023-11-29 01:12:14,906 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 01:12:14,906 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 83 treesize of output 38 [2023-11-29 01:12:14,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 01:12:15,023 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-29 01:12:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:12:15,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:12:16,062 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|)) (.cse0 (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|)) (.cse1 (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|))) (and (forall ((v_ArrVal_3737 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| v_ArrVal_3737)) .cse0) .cse1))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse0) .cse1)) (+ .cse2 4))) (= .cse1 .cse2)))) (forall ((v_ArrVal_3737 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse0) .cse1))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) .cse4) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| v_ArrVal_3737)) .cse0) .cse1) 4))) (= .cse4 .cse0)))))) is different from false [2023-11-29 01:12:16,084 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 950 treesize of output 894 [2023-11-29 01:12:16,637 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 1587 treesize of output 1475 [2023-11-29 01:12:22,900 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (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|)) (.cse5 (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|))) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse5)) (.cse8 (= .cse7 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse17 (= .cse7 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem15#1.base|))) (.cse3 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~mem15#1.offset| 4)) (.cse12 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse5))) (let ((.cse13 (not .cse12)) (.cse32 (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (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_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)) .cse3)))) (.cse16 (not .cse17)) (.cse51 (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (or (= .cse7 v_arrayElimCell_205) (= |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_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)) (+ v_arrayElimCell_205 4)))))) (.cse19 (not .cse8)) (.cse21 (not .cse0))) (let ((.cse27 (or .cse19 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (or (= .cse7 v_ArrVal_3737) (= |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_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)) (+ v_ArrVal_3737 4))))) .cse21)) (.cse33 (forall ((v_ArrVal_3737 Int)) (or (forall ((v_arrayElimCell_205 Int)) (or (= .cse7 v_arrayElimCell_205) (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse61 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 (+ v_arrayElimCell_205 4)))))))) (= .cse7 v_ArrVal_3737)))) (.cse23 (forall ((v_ArrVal_3737 Int)) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse60 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 (+ v_arrayElimCell_205 4)))))) (= .cse7 v_ArrVal_3737)))) (.cse25 (forall ((v_ArrVal_3737 Int)) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (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_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)) (+ v_ArrVal_3737 4)))) (= .cse7 v_ArrVal_3737)))) (.cse31 (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse59 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 (+ v_arrayElimCell_205 4))))))) (.cse35 (or .cse51 .cse17)) (.cse36 (or .cse13 .cse32 .cse16)) (.cse37 (or .cse51 .cse12)) (.cse38 (forall ((v_arrayElimCell_205 Int)) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse58 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 (+ v_arrayElimCell_205 4)))))) (= .cse7 v_arrayElimCell_205))))) (let ((.cse9 (let ((.cse52 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse57 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 (+ v_ArrVal_3737 4))))))) (.cse54 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse56 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)))) (or (= .cse7 v_arrayElimCell_205) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse56 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse56 (+ v_arrayElimCell_205 4)))))))) (and (or .cse13 (and .cse52 .cse31 .cse32 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse53 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 (+ v_arrayElimCell_205 4))))))) .cse16) .cse35 .cse36 (or .cse54 .cse17) (or .cse13 .cse52 .cse16) (or .cse54 .cse12) .cse37 (forall ((v_ArrVal_3737 Int) (v_arrayElimCell_205 Int)) (or (= .cse7 v_arrayElimCell_205) (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse55 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 (+ v_arrayElimCell_205 4)))))))) .cse38))) (.cse11 (let ((.cse48 (and .cse51 .cse38))) (and .cse27 .cse33 (or .cse0 .cse48) (forall ((v_ArrVal_3737 Int)) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse49 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)))) (or (= .cse7 v_arrayElimCell_205) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 (+ v_arrayElimCell_205 4)))))) (= .cse7 v_ArrVal_3737))) (or .cse19 (and .cse23 (forall ((v_ArrVal_3737 Int)) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 (+ v_arrayElimCell_205 4)))))) (= .cse7 v_ArrVal_3737))) .cse25) .cse21) (or .cse8 .cse48)))) (.cse1 (let ((.cse43 (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int) (v_ArrVal_3738 (Array Int Int))) (let ((.cse47 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7))) (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_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) .cse47) (+ v_arrayElimCell_204 4))) (= .cse47 .cse5)))))) (and (or .cse17 .cse43) (or .cse13 (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse44 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7))) (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_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) .cse44) .cse3)) (= .cse44 .cse5)))) .cse16) (or .cse43 .cse12) (forall ((v_ArrVal_3738 (Array Int Int))) (let ((.cse46 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7))) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int)) (let ((.cse45 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) .cse46))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 (+ v_arrayElimCell_204 4)))))) (= .cse46 .cse5))))))) (.cse24 (or .cse13 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse42 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse42 .cse3)) (= .cse7 v_ArrVal_3737) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse42 (+ v_ArrVal_3737 4)))))) .cse16)) (.cse10 (and .cse17 .cse12 (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem15#1.offset| .cse7))) (.cse18 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int) (v_ArrVal_3738 (Array Int Int))) (let ((.cse41 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7))) (let ((.cse40 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) .cse41))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 (+ v_arrayElimCell_204 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 (+ v_ArrVal_3737 4))) (= .cse41 .cse5))))))) (and (or .cse0 .cse1) (forall ((v_ArrVal_3738 (Array Int Int))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7))) (or (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int)) (let ((.cse2 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (+ v_arrayElimCell_204 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (+ v_ArrVal_3737 4)))))) (= .cse4 .cse5)))) (or .cse8 .cse9 .cse10) (or .cse11 .cse12) (or .cse13 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse15 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7))) (let ((.cse14 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) .cse15))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 (+ v_ArrVal_3737 4))) (= .cse15 .cse5))))) .cse16) (or .cse0 .cse9 .cse10) (or .cse17 .cse11) (or .cse18 .cse12) (or .cse19 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse20 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7))) (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_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) .cse20) (+ v_ArrVal_3737 4))) (= .cse20 .cse5)))) .cse21) (or .cse8 .cse1) (or (let ((.cse22 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)))) (or (= .cse7 v_ArrVal_3737) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 (+ v_arrayElimCell_205 4)))))))) (and (or .cse17 .cse22) .cse23 .cse24 .cse25 (or .cse22 .cse12))) .cse19 .cse21) (or (let ((.cse34 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse39 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)))) (or (= .cse7 v_arrayElimCell_205) (= .cse7 v_ArrVal_3737) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse39 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse39 (+ v_arrayElimCell_205 4))))))) (.cse28 (and .cse35 .cse36 .cse37 .cse38))) (and .cse27 (or .cse0 .cse28) (or .cse13 (let ((.cse29 (and .cse31 .cse32))) (and (or .cse8 .cse29) .cse23 (forall ((v_ArrVal_3737 Int)) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse5) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 (+ v_ArrVal_3737 4)))))) (= .cse7 v_ArrVal_3737))) (or .cse0 .cse29))) .cse16) .cse33 (or .cse12 .cse34) (or .cse17 .cse34) (or .cse8 .cse28) .cse24)) .cse10) (or .cse17 .cse18))))))) is different from false [2023-11-29 01:12:28,951 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse64 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse63 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse6 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse63 |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|)) (.cse41 (select .cse64 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse10 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse64 |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|))) (let ((.cse12 (= .cse10 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse8 (+ .cse41 4)) (.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse6)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse63 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse6)) (.cse21 (= .cse10 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (let ((.cse15 (not .cse21)) (.cse16 (not .cse2)) (.cse58 (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (or (= .cse10 v_arrayElimCell_205) (= |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_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)) (+ v_arrayElimCell_205 4)))))) (.cse4 (not .cse0)) (.cse32 (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (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_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)) .cse8)))) (.cse11 (not .cse12))) (let ((.cse31 (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse62 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse62 (+ v_arrayElimCell_205 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse62 .cse8)))))) (.cse36 (or .cse4 .cse32 .cse11)) (.cse38 (or .cse58 .cse0)) (.cse39 (or .cse12 .cse58)) (.cse24 (forall ((v_ArrVal_3737 Int)) (or (= .cse10 v_ArrVal_3737) (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse61 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 (+ v_arrayElimCell_205 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse8)))))))) (.cse25 (forall ((v_ArrVal_3737 Int)) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (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_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)) (+ v_ArrVal_3737 4)))) (= .cse10 v_ArrVal_3737)))) (.cse28 (forall ((v_ArrVal_3737 Int)) (or (forall ((v_arrayElimCell_205 Int)) (or (= .cse10 v_arrayElimCell_205) (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse60 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 (+ v_arrayElimCell_205 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 .cse8))))))) (= .cse10 v_ArrVal_3737)))) (.cse34 (or .cse15 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (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_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)) (+ v_ArrVal_3737 4))) (= .cse10 v_ArrVal_3737))) .cse16)) (.cse37 (forall ((v_arrayElimCell_205 Int)) (or (= .cse10 v_arrayElimCell_205) (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse59 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 (+ v_arrayElimCell_205 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 .cse8))))))))) (let ((.cse13 (let ((.cse57 (and .cse37 .cse58))) (and (or .cse15 (and .cse24 (forall ((v_ArrVal_3737 Int)) (or (= .cse10 v_ArrVal_3737) (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse55 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 (+ v_arrayElimCell_205 4)))))))) .cse25) .cse16) .cse28 (forall ((v_ArrVal_3737 Int)) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse56 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)))) (or (= .cse10 v_arrayElimCell_205) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse56 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse56 (+ v_arrayElimCell_205 4)))))) (= .cse10 v_ArrVal_3737))) (or .cse2 .cse57) .cse34 (or .cse21 .cse57)))) (.cse1 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int) (v_ArrVal_3738 (Array Int Int))) (let ((.cse54 (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10))) (let ((.cse53 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) .cse54))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 (+ v_arrayElimCell_204 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 (+ v_ArrVal_3737 4))) (= .cse6 .cse54)))))) (.cse18 (let ((.cse47 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse52 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 .cse8)))))) (.cse50 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse51 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)))) (or (= .cse10 v_arrayElimCell_205) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 (+ v_arrayElimCell_205 4)))))))) (and (or .cse4 (and .cse31 .cse47 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse48 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 (+ v_arrayElimCell_205 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 .cse8))))) .cse32) .cse11) .cse36 .cse37 .cse38 (forall ((v_ArrVal_3737 Int) (v_arrayElimCell_205 Int)) (or (= .cse10 v_arrayElimCell_205) (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse49 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 (+ v_arrayElimCell_205 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 .cse8))))))) (or .cse4 .cse47 .cse11) .cse39 (or .cse50 .cse12) (or .cse50 .cse0)))) (.cse3 (let ((.cse43 (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int) (v_ArrVal_3738 (Array Int Int))) (let ((.cse46 (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10))) (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_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) .cse46) (+ v_arrayElimCell_204 4))) (= .cse6 .cse46)))))) (and (or .cse4 (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse42 (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10))) (or (= .cse6 .cse42) (= |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_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) .cse42) .cse8))))) .cse11) (or .cse12 .cse43) (or .cse0 .cse43) (forall ((v_ArrVal_3738 (Array Int Int))) (let ((.cse44 (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10))) (or (= .cse6 .cse44) (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int)) (let ((.cse45 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) .cse44))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 (+ v_arrayElimCell_204 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 .cse8))))))))))) (.cse17 (and (= .cse10 .cse41) .cse12 .cse0)) (.cse22 (or .cse4 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse40 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 (+ v_ArrVal_3737 4))) (= .cse10 v_ArrVal_3737) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 .cse8))))) .cse11))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or .cse4 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10))) (let ((.cse5 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 (+ v_ArrVal_3737 4))) (= .cse6 .cse7) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 .cse8)))))) .cse11) (or .cse12 .cse13) (or (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse14 (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10))) (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_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) .cse14) (+ v_ArrVal_3737 4))) (= .cse6 .cse14)))) .cse15 .cse16) (or .cse2 .cse17 .cse18) (or .cse13 .cse0) (forall ((v_ArrVal_3738 (Array Int Int))) (let ((.cse20 (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10))) (or (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int)) (let ((.cse19 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) .cse20))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 (+ v_arrayElimCell_204 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 .cse8))))) (= .cse6 .cse20)))) (or .cse12 .cse1) (or .cse21 .cse17 .cse18) (or .cse21 .cse3) (or .cse15 (let ((.cse23 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 (+ v_ArrVal_3737 4))) (= .cse10 v_ArrVal_3737) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 (+ v_arrayElimCell_205 4)))))))) (and .cse22 (or .cse12 .cse23) (or .cse23 .cse0) .cse24 .cse25)) .cse16) (or .cse17 (let ((.cse27 (and .cse36 .cse37 .cse38 .cse39)) (.cse33 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)))) (or (= .cse10 v_arrayElimCell_205) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 (+ v_ArrVal_3737 4))) (= .cse10 v_ArrVal_3737) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 (+ v_arrayElimCell_205 4)))))))) (and (or .cse21 .cse27) .cse28 (or .cse2 .cse27) .cse22 (or .cse4 (let ((.cse29 (and .cse31 .cse32))) (and (or .cse2 .cse29) (forall ((v_ArrVal_3737 Int)) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3736) (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3738) .cse6) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 .cse8))))) (= .cse10 v_ArrVal_3737))) .cse24 (or .cse21 .cse29))) .cse11) (or .cse33 .cse0) (or .cse12 .cse33) .cse34)))))))))) is different from false [2023-11-29 01:12:59,891 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse66 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse67 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse63 (select .cse67 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse49 (select .cse66 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse63) .cse49)) (.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse67 |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|)) (.cse6 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse66 |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|))) (let ((.cse12 (= .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse63))) (.cse18 (+ .cse49 4)) (.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse4)) (.cse22 (= .cse2 .cse4)) (.cse62 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse7 (not (= (select .cse62 .cse6) .cse63))) (.cse8 (not .cse22)) (.cse20 (forall ((v_subst_12 Int)) (not (= (select .cse62 v_subst_12) .cse63)))) (.cse13 (not .cse0)) (.cse34 (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (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_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)) .cse18)))) (.cse15 (not .cse12)) (.cse58 (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (or (= .cse6 v_arrayElimCell_205) (= |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_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)) (+ v_arrayElimCell_205 4))))))) (let ((.cse37 (or .cse0 .cse58)) (.cse38 (or .cse12 .cse58)) (.cse40 (or .cse13 .cse34 .cse15)) (.cse33 (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse65 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse65 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse65 (+ v_arrayElimCell_205 4))))))) (.cse29 (or (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse64 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse64 .cse18)) (= .cse6 v_arrayElimCell_205) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse64 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse64 (+ v_arrayElimCell_205 4))) (= .cse6 v_ArrVal_3737)))) .cse20)) (.cse25 (forall ((v_subst_13 Int)) (or (not (= (select .cse62 v_subst_13) .cse63)) (= .cse6 v_subst_13)))) (.cse10 (forall ((v_ArrVal_3737 Int)) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse61 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 (+ v_arrayElimCell_205 4)))))) (= .cse6 v_ArrVal_3737)))) (.cse11 (forall ((v_ArrVal_3737 Int)) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (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_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)) (+ v_ArrVal_3737 4)))) (= .cse6 v_ArrVal_3737)))) (.cse35 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse60 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)))) (or (= .cse6 v_arrayElimCell_205) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 (+ v_arrayElimCell_205 4))) (= .cse6 v_ArrVal_3737))))) (.cse36 (or .cse7 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (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_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)) (+ v_ArrVal_3737 4))) (= .cse6 v_ArrVal_3737))) .cse8)) (.cse39 (forall ((v_arrayElimCell_205 Int)) (or (= .cse6 v_arrayElimCell_205) (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse59 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 (+ v_arrayElimCell_205 4)))))))))) (let ((.cse1 (let ((.cse56 (and .cse39 .cse58))) (and .cse29 (or .cse25 .cse56) (or .cse7 .cse8 (and .cse10 .cse11 (forall ((v_ArrVal_3737 Int)) (or (= .cse6 v_ArrVal_3737) (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse57 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 (+ v_arrayElimCell_205 4)))))))))) (or .cse22 .cse20 .cse56) (or .cse35 .cse20) .cse36))) (.cse24 (let ((.cse51 (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int) (v_ArrVal_3738 (Array Int Int))) (let ((.cse55 (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6))) (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_3731) .cse2 v_ArrVal_3736) .cse55) (+ v_arrayElimCell_204 4))) (= .cse55 .cse4)))))) (and (or .cse51 .cse0) (or .cse13 (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse52 (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6))) (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_3731) .cse2 v_ArrVal_3736) .cse52) .cse18)) (= .cse52 .cse4)))) .cse15) (or .cse12 .cse51) (forall ((v_ArrVal_3738 (Array Int Int))) (let ((.cse54 (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6))) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int)) (let ((.cse53 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) .cse54))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 (+ v_arrayElimCell_204 4)))))) (= .cse54 .cse4))))))) (.cse14 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 (+ v_ArrVal_3737 4))) (= .cse6 v_ArrVal_3737))))) (.cse21 (and (= .cse6 .cse49) .cse12 .cse0)) (.cse23 (let ((.cse43 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse48 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)))) (or (= .cse6 v_arrayElimCell_205) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 (+ v_arrayElimCell_205 4))))))) (.cse44 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse47 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 (+ v_ArrVal_3737 4)))))))) (and (or .cse12 .cse43) (or .cse0 .cse43) (or .cse13 .cse44 .cse15) .cse37 (forall ((v_ArrVal_3737 Int) (v_arrayElimCell_205 Int)) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse45 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 (+ v_arrayElimCell_205 4)))))) (= .cse6 v_arrayElimCell_205))) .cse38 .cse39 .cse40 (or .cse13 (and .cse44 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse46 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 (+ v_arrayElimCell_205 4)))))) .cse33 .cse34) .cse15)))) (.cse26 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int) (v_ArrVal_3738 (Array Int Int))) (let ((.cse42 (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6))) (let ((.cse41 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) .cse42))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 (+ v_arrayElimCell_204 4))) (= .cse42 .cse4))))))) (and (or .cse0 .cse1) (or (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse3 (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6))) (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_3731) .cse2 v_ArrVal_3736) .cse3) (+ v_ArrVal_3737 4))) (= .cse3 .cse4)))) .cse7 .cse8) (or .cse7 .cse8 (let ((.cse9 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 (+ v_arrayElimCell_205 4))) (= .cse6 v_ArrVal_3737)))))) (and (or .cse9 .cse0) .cse10 .cse11 (or .cse12 .cse9) (or .cse13 .cse14 .cse15)))) (or (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int) (v_ArrVal_3738 (Array Int Int))) (let ((.cse19 (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6))) (let ((.cse17 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) .cse19))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 (+ v_arrayElimCell_204 4))) (= .cse19 .cse4))))) .cse20) (or .cse21 .cse22 .cse20 .cse23) (or .cse12 .cse1) (or .cse24 .cse25) (or .cse24 .cse22 .cse20) (or .cse12 .cse26 .cse20) (or .cse13 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse28 (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6))) (let ((.cse27 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) .cse28))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (+ v_ArrVal_3737 4))) (= .cse28 .cse4))))) .cse15 .cse20) (or .cse21 (let ((.cse30 (and .cse37 .cse38 .cse39 .cse40))) (and .cse29 (or .cse13 .cse14 .cse15 .cse20) (or .cse30 .cse22 .cse20) (or .cse30 .cse25) (or .cse13 (let ((.cse31 (and .cse33 .cse34))) (and (or .cse14 .cse20) (or .cse31 .cse25) (or .cse20 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse32 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_3731) .cse2 v_ArrVal_3736) (select (select (store .cse5 .cse2 v_ArrVal_3738) .cse4) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse32 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse32 (+ v_ArrVal_3737 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse32 (+ v_arrayElimCell_205 4))) (= .cse6 v_ArrVal_3737))))) (or .cse31 .cse22 .cse20))) .cse15) (or .cse35 .cse12 .cse20) .cse36 (or .cse35 .cse0 .cse20)))) (or .cse21 .cse25 .cse23) (or .cse26 .cse0 .cse20))))))))) is different from false [2023-11-29 01:13:05,688 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse67 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse66 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse65 (select .cse66 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse44 (select .cse67 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse67 |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|)) (.cse6 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse66 |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|)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse65) .cse44))) (let ((.cse64 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse23 (= .cse7 .cse6)) (.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse65))) (.cse25 (+ .cse44 4)) (.cse1 (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse9)) (.cse11 (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse6))) (let ((.cse16 (not .cse11)) (.cse17 (not .cse1)) (.cse27 (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (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_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)) .cse25)))) (.cse43 (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (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_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)) (+ v_arrayElimCell_205 4))) (= v_arrayElimCell_205 .cse9)))) (.cse3 (not .cse23)) (.cse4 (not (= (select .cse64 .cse9) .cse65))) (.cse2 (forall ((v_subst_12 Int)) (not (= (select .cse64 v_subst_12) .cse65))))) (let ((.cse21 (forall ((v_subst_13 Int)) (or (not (= (select .cse64 v_subst_13) .cse65)) (= v_subst_13 .cse9)))) (.cse28 (or (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse63 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)))) (or (= v_ArrVal_3737 .cse9) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse63 (+ v_arrayElimCell_205 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse63 .cse25)) (= v_arrayElimCell_205 .cse9) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse63 (+ v_ArrVal_3737 4)))))) .cse2)) (.cse29 (or .cse3 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (or (= v_ArrVal_3737 .cse9) (= |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_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)) (+ v_ArrVal_3737 4))))) .cse4)) (.cse13 (forall ((v_ArrVal_3737 Int)) (or (= v_ArrVal_3737 .cse9) (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse62 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse62 (+ v_arrayElimCell_205 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse62 .cse25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse62 (+ v_ArrVal_3737 4))))))))) (.cse14 (forall ((v_ArrVal_3737 Int)) (or (= v_ArrVal_3737 .cse9) (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (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_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)) (+ v_ArrVal_3737 4))))))) (.cse19 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse61 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)))) (or (= v_ArrVal_3737 .cse9) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 (+ v_arrayElimCell_205 4))) (= v_arrayElimCell_205 .cse9) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 (+ v_ArrVal_3737 4))))))) (.cse30 (or .cse43 .cse11)) (.cse26 (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse60 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 (+ v_arrayElimCell_205 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 .cse25)))))) (.cse31 (forall ((v_arrayElimCell_205 Int)) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse59 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 (+ v_arrayElimCell_205 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 .cse25))))) (= v_arrayElimCell_205 .cse9)))) (.cse32 (or .cse43 .cse1)) (.cse33 (or .cse16 .cse17 .cse27))) (let ((.cse0 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int) (v_ArrVal_3738 (Array Int Int))) (let ((.cse57 (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9))) (let ((.cse58 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) .cse57))) (or (= .cse57 .cse6) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 (+ v_arrayElimCell_204 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 (+ v_ArrVal_3737 4)))))))) (.cse15 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse56 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)))) (or (= v_ArrVal_3737 .cse9) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse56 .cse25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse56 (+ v_ArrVal_3737 4))))))) (.cse35 (let ((.cse51 (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int) (v_ArrVal_3738 (Array Int Int))) (let ((.cse55 (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9))) (or (= .cse55 .cse6) (= |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_3731) .cse7 v_ArrVal_3736) .cse55) (+ v_arrayElimCell_204 4)))))))) (and (or .cse1 .cse51) (or .cse51 .cse11) (forall ((v_ArrVal_3738 (Array Int Int))) (let ((.cse52 (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9))) (or (= .cse52 .cse6) (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int)) (let ((.cse53 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) .cse52))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 .cse25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 (+ v_arrayElimCell_204 4))))))))) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse54 (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9))) (or (= .cse54 .cse6) (= |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_3731) .cse7 v_ArrVal_3736) .cse54) .cse25))))) .cse16 .cse17)))) (.cse36 (let ((.cse45 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 (+ v_arrayElimCell_205 4))) (= v_arrayElimCell_205 .cse9) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 (+ v_ArrVal_3737 4))))))) (.cse47 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse49 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 .cse25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 (+ v_ArrVal_3737 4)))))))) (and (or .cse1 .cse45) (or .cse45 .cse11) .cse30 (forall ((v_ArrVal_3737 Int) (v_arrayElimCell_205 Int)) (or (forall ((v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse46 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 (+ v_arrayElimCell_205 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 .cse25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 (+ v_ArrVal_3737 4)))))) (= v_arrayElimCell_205 .cse9))) (or .cse16 .cse17 .cse47) (or .cse16 (and .cse26 .cse27 .cse47 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse48 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 (+ v_arrayElimCell_205 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 .cse25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 (+ v_ArrVal_3737 4))))))) .cse17) .cse31 .cse32 .cse33))) (.cse34 (and .cse1 (= .cse44 .cse9) .cse11)) (.cse10 (let ((.cse41 (and .cse43 .cse31))) (and (or .cse41 .cse21) .cse28 .cse29 (or .cse3 .cse4 (and (forall ((v_ArrVal_3737 Int)) (or (= v_ArrVal_3737 .cse9) (forall ((v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse42 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse42 (+ v_arrayElimCell_205 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse42 (+ v_ArrVal_3737 4)))))))) .cse13 .cse14)) (or .cse41 .cse23 .cse2) (or .cse19 .cse2))))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse5 (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9))) (or (= .cse5 .cse6) (= |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_3731) .cse7 v_ArrVal_3736) .cse5) (+ v_ArrVal_3737 4))))))) (or .cse10 .cse11) (or .cse3 .cse4 (let ((.cse12 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)))) (or (= v_ArrVal_3737 .cse9) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 (+ v_arrayElimCell_205 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 (+ v_ArrVal_3737 4)))))))) (and (or .cse12 .cse11) .cse13 (or .cse12 .cse1) .cse14 (or .cse15 .cse16 .cse17)))) (or .cse0 .cse11 .cse2) (or (let ((.cse20 (and .cse30 .cse31 .cse32 .cse33))) (and (or .cse19 .cse1 .cse2) (or .cse20 .cse21) (or (let ((.cse22 (and .cse26 .cse27))) (and (or .cse15 .cse2) (or .cse22 .cse23 .cse2) (or (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_arrayElimCell_205 Int) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9)))) (or (= v_ArrVal_3737 .cse9) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 (+ v_arrayElimCell_205 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 .cse25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 (+ v_ArrVal_3737 4)))))) .cse2) (or .cse22 .cse21))) .cse16 .cse17) .cse28 .cse29 (or .cse15 .cse16 .cse17 .cse2) (or .cse19 .cse11 .cse2) (or .cse20 .cse23 .cse2))) .cse34) (or .cse35 .cse23 .cse2) (or .cse36 .cse21 .cse34) (or .cse35 .cse21) (or .cse36 .cse34 .cse23 .cse2) (or .cse1 .cse10) (or .cse16 (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_ArrVal_3738 (Array Int Int))) (let ((.cse37 (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9))) (let ((.cse38 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) .cse37))) (or (= .cse37 .cse6) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse38 .cse25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse38 (+ v_ArrVal_3737 4))))))) .cse17 .cse2) (or (forall ((v_ArrVal_3737 Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int) (v_ArrVal_3738 (Array Int Int))) (let ((.cse39 (select (select (store .cse8 .cse7 v_ArrVal_3738) .cse6) .cse9))) (let ((.cse40 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_3731) .cse7 v_ArrVal_3736) .cse39))) (or (= .cse39 .cse6) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 .cse25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 (+ v_arrayElimCell_204 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 (+ v_ArrVal_3737 4))))))) .cse2))))))))) is different from false [2023-11-29 01:13:23,233 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse486 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse6 (select .cse486 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse486 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse23 (= .cse3 0)) (.cse11 (+ .cse6 4)) (.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse67 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (forall ((v_prenex_204 Int) (v_DerPreprocessor_11 Int)) (let ((.cse483 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse485 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse483 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse484 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse482 (select (select .cse485 .cse2) .cse6))) (or (forall ((v_prenex_174 (Array Int Int)) (v_prenex_176 (Array Int Int)) (v_prenex_177 (Array Int Int)) (v_prenex_175 Int)) (let ((.cse481 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_174) .cse482 v_prenex_176) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse483 4 v_DerPreprocessor_11) 0 .cse2)) .cse482 v_prenex_177) .cse484) .cse3)))) (or (= .cse3 v_prenex_175) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse481 (+ v_prenex_175 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse481 .cse11))))) (= .cse482 .cse484) (not (= (select (select .cse485 .cse482) v_prenex_204) .cse2))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0))))) (.cse68 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_393 (Array Int Int)) (v_prenex_394 (Array Int Int)) (v_prenex_396 Int) (v_prenex_395 (Array Int Int)) (v_prenex_397 Int) (v_prenex_392 Int)) (let ((.cse480 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse478 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse480 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse479 (select (select .cse478 .cse2) .cse6))) (let ((.cse477 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_393) .cse479 v_prenex_394) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse480 4 v_DerPreprocessor_11) 0 .cse2)) .cse479 v_prenex_395) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)))) (or (= .cse3 v_prenex_396) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse477 (+ v_prenex_397 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse477 (+ v_prenex_396 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse477 .cse11)) (not (= (select (select .cse478 .cse479) v_prenex_392) .cse2)) (= .cse3 v_prenex_397)))))))))) (.cse69 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_391 Int)) (or (= .cse3 v_prenex_391) (forall ((v_DerPreprocessor_11 Int)) (let ((.cse476 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse473 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse476 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse474 (select (select .cse473 .cse2) .cse6))) (or (not (= (select (select .cse473 .cse474) v_prenex_391) .cse2)) (forall ((v_prenex_220 Int) (v_prenex_212 (Array Int Int)) (v_prenex_213 (Array Int Int)) (v_prenex_214 (Array Int Int))) (let ((.cse475 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_212) .cse474 v_prenex_213) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse476 4 v_DerPreprocessor_11) 0 .cse2)) .cse474 v_prenex_214) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse475 (+ v_prenex_220 4))) (= .cse3 v_prenex_220) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse475 .cse11))))))))))))))) (.cse79 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_224 Int) (v_DerPreprocessor_11 Int) (v_prenex_225 (Array Int Int)) (v_prenex_226 (Array Int Int)) (v_prenex_227 (Array Int Int))) (let ((.cse471 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse472 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse471 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse470 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse469 (select (select .cse472 .cse2) .cse6))) (or (not (= .cse469 .cse470)) (= .cse3 v_prenex_224) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_225) .cse469 v_prenex_226) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse471 4 v_DerPreprocessor_11) 0 .cse2)) .cse469 v_prenex_227) .cse470) .cse3)) (+ v_prenex_224 4))) (not (= (select (select .cse472 .cse469) .cse3) .cse2)))))))))) (.cse244 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_286 Int)) (or (forall ((v_DerPreprocessor_11 Int)) (let ((.cse467 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse468 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse467 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse466 (select (select .cse468 .cse2) .cse6))) (or (forall ((v_prenex_290 (Array Int Int)) (v_prenex_291 (Array Int Int)) (v_prenex_335 Int) (v_prenex_289 (Array Int Int))) (let ((.cse465 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_289) .cse466 v_prenex_290) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse467 4 v_DerPreprocessor_11) 0 .cse2)) .cse466 v_prenex_291) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse465 (+ v_prenex_335 4))) (= .cse3 v_prenex_335) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse465 .cse11))))) (not (= (select (select .cse468 .cse466) v_prenex_286) .cse2))))))) (= .cse3 v_prenex_286)))))) (.cse267 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (forall ((v_prenex_286 Int)) (or (forall ((v_DerPreprocessor_11 Int)) (let ((.cse464 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse461 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse464 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse462 (select (select .cse461 .cse2) .cse6))) (or (not (= (select (select .cse461 .cse462) v_prenex_286) .cse2)) (forall ((v_prenex_327 (Array Int Int)) (v_prenex_328 (Array Int Int)) (v_prenex_329 (Array Int Int)) (v_prenex_324 Int) (v_prenex_318 Int)) (let ((.cse463 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_327) .cse462 v_prenex_328) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse464 4 v_DerPreprocessor_11) 0 .cse2)) .cse462 v_prenex_329) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse463 (+ v_prenex_318 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse463 (+ v_prenex_324 4))) (= .cse3 v_prenex_318) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse463 .cse11)))))))))) (= .cse3 v_prenex_286))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0))))) (.cse29 (= .cse6 0)) (.cse308 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_274 Int)) (let ((.cse460 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse456 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse460 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse457 (select (select .cse456 .cse2) .cse6)) (.cse458 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse456 .cse457) v_prenex_274) .cse2)) (= .cse457 .cse458) (forall ((v_prenex_163 (Array Int Int)) (v_prenex_165 (Array Int Int)) (v_prenex_166 (Array Int Int)) (v_prenex_164 Int)) (let ((.cse459 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_163) .cse457 v_prenex_165) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse460 4 v_DerPreprocessor_11) 0 .cse2)) .cse457 v_prenex_166) .cse458) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse459 .cse11)) (= .cse3 v_prenex_164) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse459 (+ v_prenex_164 4)))))))))))))) (.cse309 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_274 Int)) (let ((.cse455 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse451 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse455 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse452 (select (select .cse451 .cse2) .cse6)) (.cse453 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse451 .cse452) v_prenex_274) .cse2)) (= .cse452 .cse453) (forall ((v_prenex_279 Int) (v_prenex_278 Int) (v_prenex_133 (Array Int Int)) (v_prenex_134 (Array Int Int)) (v_prenex_135 (Array Int Int))) (let ((.cse454 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_133) .cse452 v_prenex_134) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse455 4 v_DerPreprocessor_11) 0 .cse2)) .cse452 v_prenex_135) .cse453) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse454 (+ v_prenex_278 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse454 (+ v_prenex_279 4))) (= .cse3 v_prenex_278) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse454 .cse11)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0))))) (.cse34 (not .cse23))) (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_217 (Array Int Int)) (v_DerPreprocessor_11 Int) (v_prenex_391 Int) (v_prenex_215 (Array Int Int)) (v_prenex_218 Int) (v_prenex_216 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse4 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse1 (select (select .cse0 .cse2) .cse6))) (or (not (= (select (select .cse0 .cse1) v_prenex_391) .cse2)) (= .cse3 v_prenex_391) (= .cse3 v_prenex_218) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_215) .cse1 v_prenex_216) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse4 4 v_DerPreprocessor_11) 0 .cse2)) .cse1 v_prenex_217) .cse5) .cse3)) (+ v_prenex_218 4)))))))) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse5)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse13 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_286 Int)) (or (forall ((v_DerPreprocessor_11 Int)) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse12 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse9 (select (select .cse8 .cse2) .cse6))) (or (not (= (select (select .cse8 .cse9) v_prenex_286) .cse2)) (forall ((v_prenex_327 (Array Int Int)) (v_prenex_328 (Array Int Int)) (v_prenex_329 (Array Int Int)) (v_prenex_324 Int) (v_prenex_318 Int)) (let ((.cse10 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_327) .cse9 v_prenex_328) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse12 4 v_DerPreprocessor_11) 0 .cse2)) .cse9 v_prenex_329) .cse13) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ v_prenex_318 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ v_prenex_324 4))) (= .cse3 v_prenex_318) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 .cse11)))))))))) (= .cse3 v_prenex_286))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse13)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse16 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_104 Int)) (let ((.cse17 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse17 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse15 (select (select .cse14 .cse2) .cse6))) (or (not (= (select (select .cse14 .cse15) v_prenex_104) .cse2)) (= .cse15 .cse16) (forall ((v_prenex_108 (Array Int Int)) (v_prenex_109 (Array Int Int)) (v_prenex_107 Int) (v_prenex_106 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_106) .cse15 v_prenex_108) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse17 4 v_DerPreprocessor_11) 0 .cse2)) .cse15 v_prenex_109) .cse16) .cse3)) (+ v_prenex_107 4))) (= .cse3 v_prenex_107)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse16)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse19 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_259 Int) (v_DerPreprocessor_11 Int) (v_prenex_260 (Array Int Int)) (v_prenex_262 (Array Int Int)) (v_prenex_263 (Array Int Int)) (v_prenex_261 Int)) (let ((.cse22 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse22 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse18 (select (select .cse21 .cse2) .cse6))) (let ((.cse20 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_260) .cse18 v_prenex_262) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse22 4 v_DerPreprocessor_11) 0 .cse2)) .cse18 v_prenex_263) .cse19) .cse3)))) (or (not (= .cse18 .cse19)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 (+ v_prenex_259 4))) (= .cse3 v_prenex_259) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 (+ v_prenex_261 4))) (not (= (select (select .cse21 .cse18) .cse3) .cse2)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse19)))) (or .cse23 (forall ((v_prenex_402 Int) (v_DerPreprocessor_11 Int) (v_prenex_412 Int) (v_prenex_408 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_410 (Array Int Int)) (v_prenex_411 (Array Int Int))) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse28 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse26 (select (select .cse27 .cse2) .cse6)) (.cse25 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse28 4 v_DerPreprocessor_11) 0 .cse2)) .cse26 v_prenex_411) .cse25) .cse3))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= .cse3 v_prenex_402) (= .cse24 .cse25) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_408) .cse26 v_prenex_410) .cse24) (+ v_prenex_412 4))) (not (= (select (select .cse27 .cse26) v_prenex_402) .cse2))))))))) (or .cse29 (and (or (forall ((v_prenex_204 Int) (v_DerPreprocessor_11 Int) (v_prenex_170 (Array Int Int)) (v_prenex_172 (Array Int Int)) (v_prenex_173 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_171 Int)) (let ((.cse32 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse33 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse32 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse31 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (select (select .cse33 .cse2) .cse6))) (or (= .cse3 v_prenex_171) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= .cse30 .cse31) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_170) .cse30 v_prenex_172) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse32 4 v_DerPreprocessor_11) 0 .cse2)) .cse30 v_prenex_173) .cse31) .cse3)) (+ v_prenex_171 4))) (not (= (select (select .cse33 .cse30) v_prenex_204) .cse2))))))) .cse23) (or .cse34 (forall ((v_prenex_206 (Array Int Int)) (v_prenex_204 Int) (v_prenex_207 (Array Int Int)) (v_DerPreprocessor_11 Int) (v_prenex_208 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse37 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse38 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse37 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse35 (select (select .cse38 .cse2) .cse6)) (.cse36 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= .cse35 .cse36) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_206) .cse35 v_prenex_207) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse37 4 v_DerPreprocessor_11) 0 .cse2)) .cse35 v_prenex_208) .cse36) 0)) .cse11)) (not (= (select (select .cse38 .cse35) v_prenex_204) .cse2)) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse36)))))))) (or .cse34 (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse42 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_239 Int)) (or (= v_prenex_239 0) (forall ((v_DerPreprocessor_11 Int)) (let ((.cse41 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse43 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse41 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse40 (select (select .cse43 .cse2) .cse6))) (or (forall ((v_prenex_191 (Array Int Int)) (v_prenex_193 (Array Int Int)) (v_prenex_194 (Array Int Int)) (v_prenex_195 Int)) (let ((.cse39 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_193) .cse40 v_prenex_194) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse41 4 v_DerPreprocessor_11) 0 .cse2)) .cse40 v_prenex_191) .cse42) 0)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse39 .cse11)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse39 (+ v_prenex_195 4)))))) (not (= .cse2 (select (select .cse43 .cse40) v_prenex_239)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse42))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse48 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_190 (Array Int Int)) (v_DerPreprocessor_11 Int) (v_prenex_187 Int) (v_prenex_188 (Array Int Int)) (v_prenex_186 Int) (v_prenex_189 (Array Int Int))) (let ((.cse47 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse45 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse47 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse46 (select (select .cse45 .cse2) .cse6))) (let ((.cse44 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_188) .cse46 v_prenex_189) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse47 4 v_DerPreprocessor_11) 0 .cse2)) .cse46 v_prenex_190) .cse48) 0)))) (or (= v_prenex_186 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 (+ v_prenex_186 4))) (not (= (select (select .cse45 .cse46) v_prenex_187) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 .cse11)))))))) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse48))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse51 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_240 Int)) (let ((.cse52 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse49 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse52 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse50 (select (select .cse49 .cse2) .cse6))) (or (not (= (select (select .cse49 .cse50) v_prenex_240) .cse2)) (= .cse50 .cse51) (forall ((v_prenex_242 (Array Int Int)) (v_prenex_243 (Array Int Int)) (v_prenex_244 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_242) .cse50 v_prenex_243) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse52 4 v_DerPreprocessor_11) 0 .cse2)) .cse50 v_prenex_244) .cse51) 0)) .cse11)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse51))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse55 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_240 Int)) (let ((.cse57 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse53 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse57 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse54 (select (select .cse53 .cse2) .cse6))) (or (not (= (select (select .cse53 .cse54) v_prenex_240) .cse2)) (= .cse54 .cse55) (forall ((v_prenex_180 (Array Int Int)) (v_prenex_241 Int) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int))) (let ((.cse56 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_178) .cse54 v_prenex_179) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse57 4 v_DerPreprocessor_11) 0 .cse2)) .cse54 v_prenex_180) .cse55) 0)))) (or (= (select .cse56 (+ v_prenex_241 4)) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse56 .cse11)))))))))) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse55))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse62 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_182 (Array Int Int)) (v_prenex_184 (Array Int Int)) (v_prenex_245 Int) (v_prenex_185 (Array Int Int)) (v_prenex_183 Int) (v_prenex_181 Int)) (let ((.cse61 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse59 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse61 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse60 (select (select .cse59 .cse2) .cse6))) (let ((.cse58 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_182) .cse60 v_prenex_184) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse61 4 v_DerPreprocessor_11) 0 .cse2)) .cse60 v_prenex_185) .cse62) 0)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 (+ v_prenex_245 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 (+ v_prenex_183 4))) (not (= (select (select .cse59 .cse60) v_prenex_181) .cse2)) (= v_prenex_245 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 .cse11)))))))) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse62))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse65 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_239 Int)) (or (forall ((v_DerPreprocessor_11 Int)) (let ((.cse64 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse66 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse64 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse63 (select (select .cse66 .cse2) .cse6))) (or (forall ((v_prenex_192 (Array Int Int)) (v_prenex_196 (Array Int Int)) (v_prenex_197 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_192) .cse63 v_prenex_196) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse64 4 v_DerPreprocessor_11) 0 .cse2)) .cse63 v_prenex_197) .cse65) 0)) .cse11))) (not (= .cse2 (select (select .cse66 .cse63) v_prenex_239)))))))) (= v_prenex_239 0))) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse65))))))) .cse67 .cse68 .cse69 (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_235 Int) (v_prenex_234 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_236 (Array Int Int)) (v_prenex_237 (Array Int Int)) (v_prenex_238 (Array Int Int))) (let ((.cse74 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse71 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse74 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse72 (select (select .cse71 .cse2) .cse6)) (.cse73 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse70 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_236) .cse72 v_prenex_237) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse74 4 v_DerPreprocessor_11) 0 .cse2)) .cse72 v_prenex_238) .cse73) 0)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse70 (+ v_prenex_234 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse70 .cse11)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= v_prenex_234 0) (not (= (select (select .cse71 .cse72) v_prenex_235) .cse2)) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse73)))))))) .cse34) (or .cse34 (forall ((v_DerPreprocessor_11 Int) (v_prenex_219 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_222 (Array Int Int)) (v_prenex_223 (Array Int Int)) (v_prenex_391 Int)) (let ((.cse77 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse75 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse77 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse76 (select (select .cse75 .cse2) .cse6)) (.cse78 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_prenex_391 0) (not (= (select (select .cse75 .cse76) v_prenex_391) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_219) .cse76 v_prenex_222) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse77 4 v_DerPreprocessor_11) 0 .cse2)) .cse76 v_prenex_223) .cse78) 0)) .cse11)) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse78)))))))) .cse79 (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_231 Int) (v_prenex_230 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_232 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_228 Int) (v_prenex_229 Int)) (let ((.cse83 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse81 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse83 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse82 (select (select .cse81 .cse2) .cse6))) (let ((.cse80 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_230) .cse82 v_prenex_232) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse83 4 v_DerPreprocessor_11) 0 .cse2)) .cse82 v_prenex_233) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse80 (+ v_prenex_228 4))) (not (= (select (select .cse81 .cse82) v_prenex_229) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse80 (+ v_prenex_231 4))) (= .cse3 v_prenex_228) (= .cse3 v_prenex_231))))))) .cse23) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_209 (Array Int Int)) (v_prenex_221 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_210 (Array Int Int)) (v_prenex_211 (Array Int Int)) (v_prenex_391 Int)) (let ((.cse86 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse84 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse86 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse85 (select (select .cse84 .cse2) .cse6))) (or (not (= (select (select .cse84 .cse85) v_prenex_391) .cse2)) (= .cse3 v_prenex_391) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_209) .cse85 v_prenex_210) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse86 4 v_DerPreprocessor_11) 0 .cse2)) .cse85 v_prenex_211) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)) (+ v_prenex_221 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= .cse3 v_prenex_221)))))) .cse23))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int)) (let ((.cse89 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse91 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse89 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse90 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse88 (select (select .cse91 .cse2) .cse6))) (or (forall ((v_prenex_420 (Array Int Int)) (v_prenex_419 Int) (v_prenex_421 (Array Int Int)) (v_prenex_422 (Array Int Int)) (v_prenex_418 Int)) (let ((.cse87 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_420) .cse88 v_prenex_421) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse89 4 v_DerPreprocessor_11) 0 .cse2)) .cse88 v_prenex_422) .cse90) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse87 (+ v_prenex_419 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse87 .cse11)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse87 (+ v_prenex_418 4))) (= .cse3 v_prenex_418)))) (not (= .cse88 .cse90)) (not (= (select (select .cse91 .cse88) .cse3) .cse2))))))))) (or .cse34 (forall ((v_prenex_402 Int) (v_prenex_404 (Array Int Int)) (v_DerPreprocessor_11 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_413 (Array Int Int)) (v_prenex_403 (Array Int Int))) (let ((.cse96 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse94 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse96 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse92 (select (select .cse94 .cse2) .cse6)) (.cse95 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse93 (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse96 4 v_DerPreprocessor_11) 0 .cse2)) .cse92 v_prenex_404) .cse95) 0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_413) .cse92 v_prenex_403) .cse93) .cse11)) (= v_prenex_402 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (not (= (select (select .cse94 .cse92) v_prenex_402) .cse2)) (= .cse93 .cse95) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse95))))))))) (or (forall ((v_ArrVal_3737 Int) (v_DerPreprocessor_11 Int) (v_subst_12 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_ArrVal_3731 (Array Int Int)) (v_ArrVal_3736 (Array Int Int)) (v_arrayElimCell_204 Int) (v_ArrVal_3738 (Array Int Int))) (let ((.cse102 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse100 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse102 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse101 (select (select .cse100 .cse2) .cse6)) (.cse97 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse98 (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse102 4 v_DerPreprocessor_11) 0 .cse2)) .cse101 v_ArrVal_3738) .cse97) .cse3))) (let ((.cse99 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_ArrVal_3731) .cse101 v_ArrVal_3736) .cse98))) (or (= .cse97 .cse98) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse99 (+ v_arrayElimCell_204 4))) (not (= (select (select .cse100 .cse101) v_subst_12) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse99 (+ v_ArrVal_3737 4)))))))))) .cse23) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse105 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_317 (Array Int Int)) (v_DerPreprocessor_11 Int) (v_prenex_319 (Array Int Int)) (v_prenex_311 Int) (v_prenex_286 Int) (v_prenex_320 (Array Int Int))) (let ((.cse104 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse106 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse104 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse103 (select (select .cse106 .cse2) .cse6))) (or (= .cse3 v_prenex_311) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_317) .cse103 v_prenex_319) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse104 4 v_DerPreprocessor_11) 0 .cse2)) .cse103 v_prenex_320) .cse105) .cse3)) (+ v_prenex_311 4))) (not (= (select (select .cse106 .cse103) v_prenex_286) .cse2)) (= .cse3 v_prenex_286)))))) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse105)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse109 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_104 Int)) (let ((.cse111 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse107 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse111 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse108 (select (select .cse107 .cse2) .cse6))) (or (not (= (select (select .cse107 .cse108) v_prenex_104) .cse2)) (= .cse108 .cse109) (forall ((v_prenex_110 Int) (v_prenex_102 (Array Int Int)) (v_prenex_103 (Array Int Int)) (v_prenex_105 (Array Int Int))) (let ((.cse110 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_103) .cse108 v_prenex_102) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse111 4 v_DerPreprocessor_11) 0 .cse2)) .cse108 v_prenex_105) .cse109) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse110 .cse11)) (= (select .cse110 (+ v_prenex_110 4)) |c_ULTIMATE.start_main_~data~0#1|) (= .cse3 v_prenex_110))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse109)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse112 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse112) (forall ((v_DerPreprocessor_11 Int) (v_prenex_158 Int) (v_prenex_161 (Array Int Int)) (v_prenex_162 (Array Int Int)) (v_prenex_274 Int) (v_prenex_159 (Array Int Int)) (v_prenex_160 Int)) (let ((.cse116 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse113 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse116 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse114 (select (select .cse113 .cse2) .cse6))) (let ((.cse115 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_159) .cse114 v_prenex_161) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse116 4 v_DerPreprocessor_11) 0 .cse2)) .cse114 v_prenex_162) .cse112) .cse3)))) (or (= .cse3 v_prenex_160) (not (= (select (select .cse113 .cse114) v_prenex_274) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse115 (+ v_prenex_158 4))) (= .cse114 .cse112) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse115 (+ v_prenex_160 4)))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse117 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse117) (forall ((v_DerPreprocessor_11 Int)) (let ((.cse120 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse121 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse120 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse119 (select (select .cse121 .cse2) .cse6))) (or (forall ((v_prenex_82 (Array Int Int)) (v_prenex_81 (Array Int Int)) (v_prenex_78 Int) (v_prenex_79 (Array Int Int)) (v_prenex_80 Int)) (let ((.cse118 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_79) .cse119 v_prenex_81) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse120 4 v_DerPreprocessor_11) 0 .cse2)) .cse119 v_prenex_82) .cse117) .cse3)))) (or (= (select .cse118 (+ v_prenex_78 4)) |c_ULTIMATE.start_main_~data~0#1|) (= .cse3 v_prenex_78) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse118 (+ v_prenex_80 4)))))) (not (= .cse119 .cse117)) (not (= (select (select .cse121 .cse119) .cse3) .cse2)))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_282 (Array Int Int)) (v_prenex_283 (Array Int Int)) (v_prenex_285 (Array Int Int)) (v_prenex_284 Int) (v_prenex_280 Int) (v_prenex_281 Int)) (let ((.cse127 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse122 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse127 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse123 (select (select .cse122 .cse2) .cse6)) (.cse126 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse125 (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse127 4 v_DerPreprocessor_11) 0 .cse2)) .cse123 v_prenex_285) .cse126) .cse3))) (let ((.cse124 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_282) .cse123 v_prenex_283) .cse125))) (or (not (= (select (select .cse122 .cse123) v_prenex_281) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse124 (+ v_prenex_280 4))) (= .cse125 .cse126) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse124 .cse11)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse124 (+ v_prenex_284 4)))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse130 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_402 Int) (v_prenex_405 (Array Int Int)) (v_prenex_414 Int) (v_DerPreprocessor_11 Int) (v_prenex_406 (Array Int Int)) (v_prenex_407 (Array Int Int))) (let ((.cse132 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse131 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse132 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse128 (select (select .cse131 .cse2) .cse6))) (let ((.cse129 (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse132 4 v_DerPreprocessor_11) 0 .cse2)) .cse128 v_prenex_407) .cse130) .cse3))) (or (= .cse3 v_prenex_402) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_405) .cse128 v_prenex_406) .cse129) (+ v_prenex_414 4))) (= .cse129 .cse130) (not (= (select (select .cse131 .cse128) v_prenex_402) .cse2)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse130)))) (or .cse23 (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_231 Int) (v_prenex_230 (Array Int Int)) (v_prenex_232 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_228 Int) (v_prenex_229 Int)) (let ((.cse136 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse134 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse136 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse135 (select (select .cse134 .cse2) .cse6))) (let ((.cse133 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_230) .cse135 v_prenex_232) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse136 4 v_DerPreprocessor_11) 0 .cse2)) .cse135 v_prenex_233) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse133 (+ v_prenex_228 4))) (not (= (select (select .cse134 .cse135) v_prenex_229) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse133 (+ v_prenex_231 4))) (= .cse3 v_prenex_228) (= .cse3 v_prenex_231))))))))) .cse67 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_209 (Array Int Int)) (v_prenex_221 Int) (v_prenex_210 (Array Int Int)) (v_prenex_211 (Array Int Int)) (v_prenex_391 Int)) (let ((.cse139 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse137 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse139 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse138 (select (select .cse137 .cse2) .cse6))) (or (not (= (select (select .cse137 .cse138) v_prenex_391) .cse2)) (= .cse3 v_prenex_391) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_209) .cse138 v_prenex_210) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse139 4 v_DerPreprocessor_11) 0 .cse2)) .cse138 v_prenex_211) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)) (+ v_prenex_221 4))) (= .cse3 v_prenex_221)))))))) .cse68 .cse69 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_204 Int) (v_DerPreprocessor_11 Int) (v_prenex_170 (Array Int Int)) (v_prenex_172 (Array Int Int)) (v_prenex_173 (Array Int Int)) (v_prenex_171 Int)) (let ((.cse142 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse143 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse142 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse141 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse140 (select (select .cse143 .cse2) .cse6))) (or (= .cse3 v_prenex_171) (= .cse140 .cse141) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_170) .cse140 v_prenex_172) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse142 4 v_DerPreprocessor_11) 0 .cse2)) .cse140 v_prenex_173) .cse141) .cse3)) (+ v_prenex_171 4))) (not (= (select (select .cse143 .cse140) v_prenex_204) .cse2))))))))) .cse79)) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int)) (let ((.cse145 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse147 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse145 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse146 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse144 (select (select .cse147 .cse2) .cse6))) (or (forall ((v_prenex_246 Int) (v_prenex_247 (Array Int Int)) (v_prenex_248 (Array Int Int)) (v_prenex_249 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_247) .cse144 v_prenex_248) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse145 4 v_DerPreprocessor_11) 0 .cse2)) .cse144 v_prenex_249) .cse146) .cse3)) (+ v_prenex_246 4)) |c_ULTIMATE.start_main_~data~0#1|) (= .cse3 v_prenex_246))) (not (= .cse144 .cse146)) (not (= (select (select .cse147 .cse144) .cse3) .cse2))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse152 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_393 (Array Int Int)) (v_prenex_394 (Array Int Int)) (v_prenex_396 Int) (v_prenex_395 (Array Int Int)) (v_prenex_397 Int) (v_prenex_392 Int)) (let ((.cse151 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse149 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse151 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse150 (select (select .cse149 .cse2) .cse6))) (let ((.cse148 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_393) .cse150 v_prenex_394) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse151 4 v_DerPreprocessor_11) 0 .cse2)) .cse150 v_prenex_395) .cse152) .cse3)))) (or (= .cse3 v_prenex_396) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse148 (+ v_prenex_397 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse148 (+ v_prenex_396 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse148 .cse11)) (not (= (select (select .cse149 .cse150) v_prenex_392) .cse2)) (= .cse3 v_prenex_397))))))) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse152)))) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_256 Int) (v_prenex_254 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_255 (Array Int Int)) (v_prenex_257 (Array Int Int)) (v_prenex_258 (Array Int Int))) (let ((.cse157 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse156 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse157 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse154 (select (select .cse156 .cse2) .cse6)) (.cse155 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse153 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_255) .cse154 v_prenex_257) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse157 4 v_DerPreprocessor_11) 0 .cse2)) .cse154 v_prenex_258) .cse155) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse153 (+ v_prenex_256 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse153 (+ v_prenex_254 4))) (not (= .cse154 .cse155)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= .cse3 v_prenex_254) (not (= (select (select .cse156 .cse154) .cse3) .cse2)))))))) .cse23) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse160 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_146 Int) (v_prenex_274 Int) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_148 (Array Int Int))) (let ((.cse161 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse158 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse161 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse159 (select (select .cse158 .cse2) .cse6))) (or (= .cse3 v_prenex_146) (not (= (select (select .cse158 .cse159) v_prenex_274) .cse2)) (= .cse159 .cse160) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_145) .cse159 v_prenex_147) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse161 4 v_DerPreprocessor_11) 0 .cse2)) .cse159 v_prenex_148) .cse160) .cse3)) (+ v_prenex_146 4)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse160)))) (or (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_346 Int) (v_prenex_381 (Array Int Int)) (v_prenex_344 Int) (v_prenex_374 Int) (v_prenex_388 (Array Int Int)) (v_prenex_389 (Array Int Int))) (let ((.cse165 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse163 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse165 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse164 (select (select .cse163 .cse2) .cse6))) (let ((.cse162 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_381) .cse164 v_prenex_389) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse165 4 v_DerPreprocessor_11) 0 .cse2)) .cse164 v_prenex_388) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse162 (+ v_prenex_374 4))) (= .cse3 v_prenex_346) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse162 (+ v_prenex_346 4))) (not (= (select (select .cse163 .cse164) v_prenex_344) .cse2)) (= .cse3 v_prenex_374) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse162 .cse11)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int)) (let ((.cse169 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse170 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse169 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse167 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse166 (select (select .cse170 .cse2) .cse6))) (or (not (= .cse166 .cse167)) (forall ((v_prenex_382 (Array Int Int)) (v_prenex_384 (Array Int Int)) (v_prenex_375 Int) (v_prenex_353 Int) (v_prenex_369 (Array Int Int))) (let ((.cse168 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_369) .cse166 v_prenex_384) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse169 4 v_DerPreprocessor_11) 0 .cse2)) .cse166 v_prenex_382) .cse167) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse168 (+ v_prenex_353 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse168 (+ v_prenex_375 4))) (= .cse3 v_prenex_375)))) (not (= (select (select .cse170 .cse166) .cse3) .cse2))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_387 Int)) (let ((.cse174 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse175 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse174 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse172 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse171 (select (select .cse175 .cse2) .cse6))) (or (= .cse171 .cse172) (forall ((v_prenex_365 Int) (v_prenex_350 (Array Int Int)) (v_prenex_351 (Array Int Int)) (v_prenex_355 (Array Int Int))) (let ((.cse173 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_351) .cse171 v_prenex_350) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse174 4 v_DerPreprocessor_11) 0 .cse2)) .cse171 v_prenex_355) .cse172) .cse3)))) (or (= .cse3 v_prenex_365) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse173 (+ v_prenex_365 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse173 .cse11))))) (not (= (select (select .cse175 .cse171) v_prenex_387) .cse2))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (forall ((v_prenex_390 (Array Int Int)) (v_prenex_345 Int) (v_DerPreprocessor_11 Int) (v_prenex_360 (Array Int Int)) (v_prenex_386 Int) (v_prenex_358 (Array Int Int)) (v_prenex_349 Int)) (let ((.cse179 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse177 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse179 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse178 (select (select .cse177 .cse2) .cse6))) (let ((.cse176 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_390) .cse178 v_prenex_360) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse179 4 v_DerPreprocessor_11) 0 .cse2)) .cse178 v_prenex_358) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)))) (or (= .cse3 v_prenex_386) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse176 (+ v_prenex_386 4))) (= (select .cse176 (+ v_prenex_349 4)) |c_ULTIMATE.start_main_~data~0#1|) (not (= .cse2 (select (select .cse177 .cse178) v_prenex_345))) (= .cse3 v_prenex_349))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_343 Int)) (or (forall ((v_DerPreprocessor_11 Int)) (let ((.cse182 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse180 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse182 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse181 (select (select .cse180 .cse2) .cse6))) (or (not (= (select (select .cse180 .cse181) v_prenex_343) .cse2)) (forall ((v_prenex_372 (Array Int Int)) (v_prenex_352 Int) (v_prenex_373 (Array Int Int)) (v_prenex_368 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_368) .cse181 v_prenex_372) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse182 4 v_DerPreprocessor_11) 0 .cse2)) .cse181 v_prenex_373) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)) (+ v_prenex_352 4))) (= .cse3 v_prenex_352)))))))) (= .cse3 v_prenex_343))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_343 Int)) (or (forall ((v_DerPreprocessor_11 Int)) (let ((.cse186 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse183 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse186 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse184 (select (select .cse183 .cse2) .cse6))) (or (not (= (select (select .cse183 .cse184) v_prenex_343) .cse2)) (forall ((v_prenex_367 (Array Int Int)) (v_prenex_357 (Array Int Int)) (v_prenex_380 Int) (v_prenex_359 (Array Int Int))) (let ((.cse185 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_359) .cse184 v_prenex_357) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse186 4 v_DerPreprocessor_11) 0 .cse2)) .cse184 v_prenex_367) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse185 (+ v_prenex_380 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse185 .cse11)) (= .cse3 v_prenex_380))))))))) (= .cse3 v_prenex_343))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_377 Int) (v_prenex_371 (Array Int Int)) (v_prenex_347 (Array Int Int)) (v_prenex_348 (Array Int Int))) (let ((.cse189 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse190 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse189 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse188 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse187 (select (select .cse190 .cse2) .cse6))) (or (= .cse3 v_prenex_377) (not (= .cse187 .cse188)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_371) .cse187 v_prenex_347) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse189 4 v_DerPreprocessor_11) 0 .cse2)) .cse187 v_prenex_348) .cse188) .cse3)) (+ v_prenex_377 4))) (not (= (select (select .cse190 .cse187) .cse3) .cse2))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int)) (let ((.cse192 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse194 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse192 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse193 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse191 (select (select .cse194 .cse2) .cse6))) (or (forall ((v_prenex_370 (Array Int Int)) (v_prenex_376 Int) (v_prenex_361 (Array Int Int)) (v_prenex_363 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_363) .cse191 v_prenex_361) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse192 4 v_DerPreprocessor_11) 0 .cse2)) .cse191 v_prenex_370) .cse193) .cse3)) (+ v_prenex_376 4))) (= .cse3 v_prenex_376))) (not (= .cse191 .cse193)) (not (= (select (select .cse194 .cse191) .cse3) .cse2))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_387 Int)) (let ((.cse197 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse198 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse197 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse196 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse195 (select (select .cse198 .cse2) .cse6))) (or (= .cse195 .cse196) (forall ((v_prenex_354 Int) (v_prenex_383 (Array Int Int)) (v_prenex_385 (Array Int Int)) (v_prenex_356 (Array Int Int))) (or (= .cse3 v_prenex_354) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_356) .cse195 v_prenex_383) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse197 4 v_DerPreprocessor_11) 0 .cse2)) .cse195 v_prenex_385) .cse196) .cse3)) (+ v_prenex_354 4))))) (not (= (select (select .cse198 .cse195) v_prenex_387) .cse2))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int)) (let ((.cse202 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse203 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse202 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse200 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse199 (select (select .cse203 .cse2) .cse6))) (or (not (= .cse199 .cse200)) (forall ((v_prenex_378 Int) (v_prenex_379 Int) (v_prenex_362 (Array Int Int)) (v_prenex_364 (Array Int Int)) (v_prenex_366 (Array Int Int))) (let ((.cse201 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_366) .cse199 v_prenex_364) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse202 4 v_DerPreprocessor_11) 0 .cse2)) .cse199 v_prenex_362) .cse200) .cse3)))) (or (= (select .cse201 (+ v_prenex_379 4)) |c_ULTIMATE.start_main_~data~0#1|) (= .cse3 v_prenex_379) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse201 .cse11)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse201 (+ v_prenex_378 4)))))) (not (= (select (select .cse203 .cse199) .cse3) .cse2)))))))))) .cse23) (or (forall ((v_prenex_305 (Array Int Int)) (v_DerPreprocessor_11 Int) (v_prenex_323 Int) (v_prenex_310 Int) (v_prenex_286 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_303 (Array Int Int)) (v_prenex_304 (Array Int Int))) (let ((.cse208 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse205 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse208 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse206 (select (select .cse205 .cse2) .cse6)) (.cse207 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse204 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_303) .cse206 v_prenex_304) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse208 4 v_DerPreprocessor_11) 0 .cse2)) .cse206 v_prenex_305) .cse207) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse204 (+ v_prenex_310 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse204 (+ v_prenex_323 4))) (not (= (select (select .cse205 .cse206) v_prenex_286) .cse2)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse207) (= .cse3 v_prenex_286) (= .cse3 v_prenex_323))))))) .cse23) (or .cse34 (forall ((v_prenex_426 (Array Int Int)) (v_prenex_424 Int) (v_prenex_427 (Array Int Int)) (v_DerPreprocessor_11 Int) (v_prenex_423 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_425 (Array Int Int))) (let ((.cse214 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse210 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse214 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse211 (select (select .cse210 .cse2) .cse6)) (.cse213 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse212 (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse214 4 v_DerPreprocessor_11) 0 .cse2)) .cse211 v_prenex_427) .cse213) 0))) (let ((.cse209 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_425) .cse211 v_prenex_426) .cse212))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse209 .cse11)) (not (= (select (select .cse210 .cse211) v_prenex_424) .cse2)) (= .cse212 .cse213) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse209 (+ v_prenex_423 4))) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse213)))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse215 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse215) (forall ((v_subst_13 Int)) (or (= .cse3 v_subst_13) (forall ((v_DerPreprocessor_11 Int)) (let ((.cse218 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse219 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse218 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse217 (select (select .cse219 .cse2) .cse6))) (or (forall ((v_prenex_72 (Array Int Int)) (v_prenex_70 (Array Int Int)) (v_prenex_73 (Array Int Int)) (v_prenex_71 Int)) (let ((.cse216 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_70) .cse217 v_prenex_72) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse218 4 v_DerPreprocessor_11) 0 .cse2)) .cse217 v_prenex_73) .cse215) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse216 .cse11)) (= (select .cse216 (+ v_prenex_71 4)) |c_ULTIMATE.start_main_~data~0#1|) (= .cse3 v_prenex_71)))) (not (= (select (select .cse219 .cse217) v_subst_13) .cse2)))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse220 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse220) (forall ((v_prenex_286 Int)) (or (forall ((v_DerPreprocessor_11 Int)) (let ((.cse223 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse224 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse223 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse222 (select (select .cse224 .cse2) .cse6))) (or (forall ((v_prenex_290 (Array Int Int)) (v_prenex_291 (Array Int Int)) (v_prenex_335 Int) (v_prenex_289 (Array Int Int))) (let ((.cse221 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_289) .cse222 v_prenex_290) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse223 4 v_DerPreprocessor_11) 0 .cse2)) .cse222 v_prenex_291) .cse220) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse221 (+ v_prenex_335 4))) (= .cse3 v_prenex_335) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse221 .cse11))))) (not (= (select (select .cse224 .cse222) v_prenex_286) .cse2))))))) (= .cse3 v_prenex_286)))))) (or (forall ((v_prenex_118 (Array Int Int)) (v_prenex_117 Int) (v_DerPreprocessor_11 Int) (v_prenex_269 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int))) (let ((.cse229 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse228 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse229 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse225 (select (select .cse228 .cse2) .cse6)) (.cse227 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse226 (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse229 4 v_DerPreprocessor_11) 0 .cse2)) .cse225 v_prenex_118) .cse227) .cse3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_115) .cse225 v_prenex_116) .cse226) (+ v_prenex_117 4))) (= .cse226 .cse227) (not (= (select (select .cse228 .cse225) v_prenex_269) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= .cse225 .cse227))))))) .cse23) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse230 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse230) (forall ((v_prenex_336 Int) (v_DerPreprocessor_11 Int) (v_prenex_309 (Array Int Int)) (v_prenex_321 Int) (v_prenex_286 Int) (v_prenex_287 (Array Int Int)) (v_prenex_288 (Array Int Int))) (let ((.cse234 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse232 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse234 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse233 (select (select .cse232 .cse2) .cse6))) (let ((.cse231 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_309) .cse233 v_prenex_287) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse234 4 v_DerPreprocessor_11) 0 .cse2)) .cse233 v_prenex_288) .cse230) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse231 (+ v_prenex_321 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse231 (+ v_prenex_336 4))) (not (= (select (select .cse232 .cse233) v_prenex_286) .cse2)) (= .cse3 v_prenex_336) (= .cse3 v_prenex_286)))))))))) (or .cse29 (and (or .cse34 (forall ((v_DerPreprocessor_11 Int) (v_prenex_286 Int) (v_prenex_298 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_330 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_332 (Array Int Int))) (let ((.cse239 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse236 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse239 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse237 (select (select .cse236 .cse2) .cse6)) (.cse238 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse235 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_330) .cse237 v_prenex_331) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse239 4 v_DerPreprocessor_11) 0 .cse2)) .cse237 v_prenex_332) .cse238) 0)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse235 .cse11)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (not (= (select (select .cse236 .cse237) v_prenex_286) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse235 (+ v_prenex_298 4))) (= v_prenex_286 0) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse238))))))))) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_286 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_300 (Array Int Int)) (v_prenex_301 (Array Int Int)) (v_prenex_302 (Array Int Int))) (let ((.cse241 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse243 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse241 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse240 (select (select .cse243 .cse2) .cse6)) (.cse242 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |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| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_300) .cse240 v_prenex_301) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse241 4 v_DerPreprocessor_11) 0 .cse2)) .cse240 v_prenex_302) .cse242) 0)) .cse11)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (not (= (select (select .cse243 .cse240) v_prenex_286) .cse2)) (= v_prenex_286 0) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse242))))))) .cse34) .cse244 (or .cse23 (forall ((v_prenex_306 (Array Int Int)) (v_DerPreprocessor_11 Int) (v_prenex_307 (Array Int Int)) (v_prenex_308 (Array Int Int)) (v_prenex_322 Int) (v_prenex_286 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse246 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse247 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse246 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse245 (select (select .cse247 .cse2) .cse6))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_306) .cse245 v_prenex_307) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse246 4 v_DerPreprocessor_11) 0 .cse2)) .cse245 v_prenex_308) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)) (+ v_prenex_322 4))) (not (= (select (select .cse247 .cse245) v_prenex_286) .cse2)) (= .cse3 v_prenex_286) (= .cse3 v_prenex_322))))))) (or .cse34 (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse251 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_286 Int)) (or (forall ((v_DerPreprocessor_11 Int)) (let ((.cse250 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse252 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse250 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse249 (select (select .cse252 .cse2) .cse6))) (or (forall ((v_prenex_334 Int) (v_prenex_292 (Array Int Int)) (v_prenex_293 (Array Int Int)) (v_prenex_294 (Array Int Int))) (let ((.cse248 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_292) .cse249 v_prenex_293) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse250 4 v_DerPreprocessor_11) 0 .cse2)) .cse249 v_prenex_294) .cse251) 0)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse248 .cse11)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse248 (+ v_prenex_334 4)))))) (not (= (select (select .cse252 .cse249) v_prenex_286) .cse2))))))) (= v_prenex_286 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse251))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse255 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_286 Int)) (or (forall ((v_DerPreprocessor_11 Int)) (let ((.cse254 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse256 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse254 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse253 (select (select .cse256 .cse2) .cse6))) (or (forall ((v_prenex_295 (Array Int Int)) (v_prenex_296 (Array Int Int)) (v_prenex_297 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_295) .cse253 v_prenex_296) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse254 4 v_DerPreprocessor_11) 0 .cse2)) .cse253 v_prenex_297) .cse255) 0)) .cse11))) (not (= (select (select .cse256 .cse253) v_prenex_286) .cse2))))))) (= v_prenex_286 0))) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse255))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse260 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_286 Int)) (or (forall ((v_DerPreprocessor_11 Int)) (let ((.cse259 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse261 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse259 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse258 (select (select .cse261 .cse2) .cse6))) (or (forall ((v_prenex_299 Int) (v_prenex_333 (Array Int Int)) (v_prenex_325 (Array Int Int)) (v_prenex_326 (Array Int Int))) (let ((.cse257 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_333) .cse258 v_prenex_325) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse259 4 v_DerPreprocessor_11) 0 .cse2)) .cse258 v_prenex_326) .cse260) 0)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse257 (+ v_prenex_299 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse257 .cse11))))) (not (= (select (select .cse261 .cse258) v_prenex_286) .cse2))))))) (= v_prenex_286 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse260))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse265 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_286 Int)) (or (forall ((v_DerPreprocessor_11 Int)) (let ((.cse264 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse266 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse264 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse263 (select (select .cse266 .cse2) .cse6))) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_312 Int) (v_prenex_313 Int) (v_prenex_314 (Array Int Int)) (v_prenex_315 (Array Int Int))) (let ((.cse262 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_314) .cse263 v_prenex_315) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse264 4 v_DerPreprocessor_11) 0 .cse2)) .cse263 v_prenex_316) .cse265) 0)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse262 (+ v_prenex_312 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse262 .cse11)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse262 (+ v_prenex_313 4)))))) (not (= (select (select .cse266 .cse263) v_prenex_286) .cse2))))))) (= v_prenex_286 0))) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse265))))))) .cse267 (or (forall ((v_prenex_305 (Array Int Int)) (v_DerPreprocessor_11 Int) (v_prenex_323 Int) (v_prenex_310 Int) (v_prenex_286 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_303 (Array Int Int)) (v_prenex_304 (Array Int Int))) (let ((.cse271 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse269 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse271 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse270 (select (select .cse269 .cse2) .cse6))) (let ((.cse268 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_303) .cse270 v_prenex_304) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse271 4 v_DerPreprocessor_11) 0 .cse2)) .cse270 v_prenex_305) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse268 (+ v_prenex_310 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse268 (+ v_prenex_323 4))) (not (= (select (select .cse269 .cse270) v_prenex_286) .cse2)) (= .cse3 v_prenex_286) (= .cse3 v_prenex_323))))))) .cse23))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse275 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_204 Int) (v_DerPreprocessor_11 Int)) (let ((.cse274 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse276 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse274 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse273 (select (select .cse276 .cse2) .cse6))) (or (forall ((v_prenex_174 (Array Int Int)) (v_prenex_176 (Array Int Int)) (v_prenex_177 (Array Int Int)) (v_prenex_175 Int)) (let ((.cse272 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_174) .cse273 v_prenex_176) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse274 4 v_DerPreprocessor_11) 0 .cse2)) .cse273 v_prenex_177) .cse275) .cse3)))) (or (= .cse3 v_prenex_175) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse272 (+ v_prenex_175 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse272 .cse11))))) (= .cse273 .cse275) (not (= (select (select .cse276 .cse273) v_prenex_204) .cse2))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse275)))) (or .cse23 (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_305 (Array Int Int)) (v_DerPreprocessor_11 Int) (v_prenex_323 Int) (v_prenex_310 Int) (v_prenex_286 Int) (v_prenex_303 (Array Int Int)) (v_prenex_304 (Array Int Int))) (let ((.cse280 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse278 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse280 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse279 (select (select .cse278 .cse2) .cse6))) (let ((.cse277 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_303) .cse279 v_prenex_304) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse280 4 v_DerPreprocessor_11) 0 .cse2)) .cse279 v_prenex_305) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse277 (+ v_prenex_310 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse277 (+ v_prenex_323 4))) (not (= (select (select .cse278 .cse279) v_prenex_286) .cse2)) (= .cse3 v_prenex_286) (= .cse3 v_prenex_323))))))))) .cse244 .cse267 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (forall ((v_prenex_306 (Array Int Int)) (v_DerPreprocessor_11 Int) (v_prenex_307 (Array Int Int)) (v_prenex_308 (Array Int Int)) (v_prenex_322 Int) (v_prenex_286 Int)) (let ((.cse282 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse283 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse282 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse281 (select (select .cse283 .cse2) .cse6))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_306) .cse281 v_prenex_307) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse282 4 v_DerPreprocessor_11) 0 .cse2)) .cse281 v_prenex_308) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)) (+ v_prenex_322 4))) (not (= (select (select .cse283 .cse281) v_prenex_286) .cse2)) (= .cse3 v_prenex_286) (= .cse3 v_prenex_322)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse284 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse284) (forall ((v_prenex_90 Int) (v_DerPreprocessor_11 Int) (v_prenex_92 (Array Int Int)) (v_prenex_91 (Array Int Int)) (v_prenex_88 Int) (v_prenex_89 (Array Int Int)) (v_prenex_87 Int)) (let ((.cse288 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse285 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse288 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse286 (select (select .cse285 .cse2) .cse6))) (let ((.cse287 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_89) .cse286 v_prenex_91) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse288 4 v_DerPreprocessor_11) 0 .cse2)) .cse286 v_prenex_92) .cse284) .cse3)))) (or (= .cse3 v_prenex_87) (= .cse3 v_prenex_90) (not (= (select (select .cse285 .cse286) v_prenex_88) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse287 (+ v_prenex_90 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse287 (+ v_prenex_87 4)))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse293 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_83 (Array Int Int)) (v_prenex_268 Int) (v_DerPreprocessor_11 Int) (v_prenex_86 (Array Int Int)) (v_prenex_85 (Array Int Int)) (v_prenex_264 Int) (v_prenex_84 Int)) (let ((.cse292 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse290 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse292 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse291 (select (select .cse290 .cse2) .cse6))) (let ((.cse289 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_83) .cse291 v_prenex_85) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse292 4 v_DerPreprocessor_11) 0 .cse2)) .cse291 v_prenex_86) .cse293) .cse3)))) (or (= .cse3 v_prenex_84) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse289 (+ v_prenex_268 4))) (= .cse3 v_prenex_268) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse289 .cse11)) (not (= (select (select .cse290 .cse291) v_prenex_264) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse289 (+ v_prenex_84 4))))))))) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse293)))) (or (forall ((v_prenex_204 Int) (v_DerPreprocessor_11 Int) (v_prenex_170 (Array Int Int)) (v_prenex_172 (Array Int Int)) (v_prenex_173 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_171 Int)) (let ((.cse296 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse297 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse296 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse295 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse294 (select (select .cse297 .cse2) .cse6))) (or (= .cse3 v_prenex_171) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= .cse294 .cse295) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_170) .cse294 v_prenex_172) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse296 4 v_DerPreprocessor_11) 0 .cse2)) .cse294 v_prenex_173) .cse295) .cse3)) (+ v_prenex_171 4))) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse295) (not (= (select (select .cse297 .cse294) v_prenex_204) .cse2))))))) .cse23) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_269 Int)) (let ((.cse303 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse298 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse303 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse299 (select (select .cse298 .cse2) .cse6)) (.cse300 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse298 .cse299) v_prenex_269) .cse2)) (= .cse299 .cse300) (forall ((v_prenex_271 (Array Int Int)) (v_prenex_272 (Array Int Int)) (v_prenex_273 (Array Int Int)) (v_prenex_270 Int)) (let ((.cse302 (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse303 4 v_DerPreprocessor_11) 0 .cse2)) .cse299 v_prenex_273) .cse300) .cse3))) (let ((.cse301 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_271) .cse299 v_prenex_272) .cse302))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse301 (+ v_prenex_270 4))) (= .cse302 .cse300) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse301 .cse11))))))))))))) (or .cse23 (forall ((v_prenex_306 (Array Int Int)) (v_DerPreprocessor_11 Int) (v_prenex_307 (Array Int Int)) (v_prenex_308 (Array Int Int)) (v_prenex_322 Int) (v_prenex_286 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse305 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse307 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse305 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse304 (select (select .cse307 .cse2) .cse6)) (.cse306 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_306) .cse304 v_prenex_307) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse305 4 v_DerPreprocessor_11) 0 .cse2)) .cse304 v_prenex_308) .cse306) .cse3)) (+ v_prenex_322 4))) (not (= (select (select .cse307 .cse304) v_prenex_286) .cse2)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse306) (= .cse3 v_prenex_286) (= .cse3 v_prenex_322))))))) (or (and .cse308 .cse309 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_155 Int) (v_prenex_154 (Array Int Int)) (v_prenex_274 Int) (v_prenex_156 (Array Int Int)) (v_prenex_157 (Array Int Int))) (let ((.cse313 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse310 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse313 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse311 (select (select .cse310 .cse2) .cse6)) (.cse312 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse310 .cse311) v_prenex_274) .cse2)) (= .cse311 .cse312) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_154) .cse311 v_prenex_156) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse313 4 v_DerPreprocessor_11) 0 .cse2)) .cse311 v_prenex_157) .cse312) .cse3)) (+ v_prenex_155 4))) (= .cse3 v_prenex_155)))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (forall ((v_prenex_149 Int) (v_DerPreprocessor_11 Int) (v_prenex_150 (Array Int Int)) (v_prenex_152 (Array Int Int)) (v_prenex_153 (Array Int Int)) (v_prenex_274 Int) (v_prenex_151 Int)) (let ((.cse318 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse314 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse318 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse315 (select (select .cse314 .cse2) .cse6)) (.cse316 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse317 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_150) .cse315 v_prenex_152) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse318 4 v_DerPreprocessor_11) 0 .cse2)) .cse315 v_prenex_153) .cse316) .cse3)))) (or (not (= (select (select .cse314 .cse315) v_prenex_274) .cse2)) (= .cse315 .cse316) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse317 (+ v_prenex_149 4))) (= .cse3 v_prenex_151) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse317 (+ v_prenex_151 4))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0))))) .cse23) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse320 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_100 (Array Int Int)) (v_prenex_98 Int) (v_prenex_101 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse321 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse322 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse321 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse319 (select (select .cse322 .cse2) .cse6))) (or (not (= .cse319 .cse320)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_99) .cse319 v_prenex_100) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse321 4 v_DerPreprocessor_11) 0 .cse2)) .cse319 v_prenex_101) .cse320) .cse3)) (+ v_prenex_98 4))) (= .cse3 v_prenex_98) (not (= (select (select .cse322 .cse319) .cse3) .cse2))))))) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse320)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse326 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_subst_13 Int)) (or (= .cse3 v_subst_13) (forall ((v_DerPreprocessor_11 Int)) (let ((.cse325 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse323 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse325 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse324 (select (select .cse323 .cse2) .cse6))) (or (not (= (select (select .cse323 .cse324) v_subst_13) .cse2)) (forall ((v_prenex_265 (Array Int Int)) (v_prenex_266 (Array Int Int)) (v_prenex_267 (Array Int Int)) (v_arrayElimCell_205 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_265) .cse324 v_prenex_266) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse325 4 v_DerPreprocessor_11) 0 .cse2)) .cse324 v_prenex_267) .cse326) .cse3)) (+ v_arrayElimCell_205 4))) (= .cse3 v_arrayElimCell_205)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse326)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse331 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_201 Int) (v_prenex_198 Int) (v_prenex_199 Int) (v_prenex_200 (Array Int Int)) (v_prenex_202 (Array Int Int)) (v_prenex_203 (Array Int Int))) (let ((.cse330 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse328 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse330 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse329 (select (select .cse328 .cse2) .cse6))) (let ((.cse327 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_200) .cse329 v_prenex_202) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse330 4 v_DerPreprocessor_11) 0 .cse2)) .cse329 v_prenex_203) .cse331) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse327 (+ v_prenex_198 4))) (not (= (select (select .cse328 .cse329) v_prenex_199) .cse2)) (= .cse3 v_prenex_198) (= .cse3 v_prenex_201) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse327 (+ v_prenex_201 4))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse331)))) (or .cse34 (forall ((v_DerPreprocessor_11 Int) (v_prenex_251 (Array Int Int)) (v_prenex_252 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_253 (Array Int Int)) (v_prenex_250 Int)) (let ((.cse336 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse335 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse336 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse333 (select (select .cse335 .cse2) .cse6)) (.cse334 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse332 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_251) .cse333 v_prenex_252) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse336 4 v_DerPreprocessor_11) 0 .cse2)) .cse333 v_prenex_253) .cse334) 0)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse332 .cse11)) (not (= .cse333 .cse334)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (not (= (select (select .cse335 .cse333) 0) .cse2)) (= v_prenex_250 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse332 (+ v_prenex_250 4))) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse334))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse338 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_224 Int) (v_DerPreprocessor_11 Int) (v_prenex_225 (Array Int Int)) (v_prenex_226 (Array Int Int)) (v_prenex_227 (Array Int Int))) (let ((.cse339 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse340 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse339 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse337 (select (select .cse340 .cse2) .cse6))) (or (not (= .cse337 .cse338)) (= .cse3 v_prenex_224) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_225) .cse337 v_prenex_226) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse339 4 v_DerPreprocessor_11) 0 .cse2)) .cse337 v_prenex_227) .cse338) .cse3)) (+ v_prenex_224 4))) (not (= (select (select .cse340 .cse337) .cse3) .cse2))))))) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse338)))) (or .cse34 (forall ((v_prenex_119 (Array Int Int)) (v_DerPreprocessor_11 Int) (v_prenex_269 Int) (v_prenex_120 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_121 (Array Int Int))) (let ((.cse345 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse341 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse345 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse342 (select (select .cse341 .cse2) .cse6)) (.cse343 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse344 (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse345 4 v_DerPreprocessor_11) 0 .cse2)) .cse342 v_prenex_121) .cse343) 0))) (or (not (= (select (select .cse341 .cse342) v_prenex_269) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= .cse342 .cse343) (= .cse344 .cse343) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_119) .cse342 v_prenex_120) .cse344) .cse11)) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse343))))))))) (or .cse23 (forall ((v_prenex_149 Int) (v_DerPreprocessor_11 Int) (v_prenex_150 (Array Int Int)) (v_prenex_152 (Array Int Int)) (v_prenex_153 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_274 Int) (v_prenex_151 Int)) (let ((.cse350 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse346 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse350 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse347 (select (select .cse346 .cse2) .cse6)) (.cse348 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse349 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_150) .cse347 v_prenex_152) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse350 4 v_DerPreprocessor_11) 0 .cse2)) .cse347 v_prenex_153) .cse348) .cse3)))) (or (not (= (select (select .cse346 .cse347) v_prenex_274) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= .cse347 .cse348) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse348) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse349 (+ v_prenex_149 4))) (= .cse3 v_prenex_151) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse349 (+ v_prenex_151 4)))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse351 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse351) (forall ((v_DerPreprocessor_11 Int)) (let ((.cse355 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse353 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse355 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse352 (select (select .cse353 .cse2) .cse6))) (or (not (= .cse352 .cse351)) (not (= (select (select .cse353 .cse352) .cse3) .cse2)) (forall ((v_prenex_97 (Array Int Int)) (v_prenex_96 (Array Int Int)) (v_prenex_95 (Array Int Int)) (v_prenex_94 Int) (v_prenex_93 Int)) (let ((.cse354 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_95) .cse352 v_prenex_96) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse355 4 v_DerPreprocessor_11) 0 .cse2)) .cse352 v_prenex_97) .cse351) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse354 .cse11)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse354 (+ v_prenex_94 4))) (= .cse3 v_prenex_93) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse354 (+ v_prenex_93 4)))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse356 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse356) (forall ((v_prenex_339 (Array Int Int)) (v_prenex_337 Int) (v_DerPreprocessor_11 Int) (v_prenex_341 Int) (v_prenex_340 (Array Int Int)) (v_prenex_342 (Array Int Int)) (v_prenex_338 Int)) (let ((.cse361 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse358 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse361 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse359 (select (select .cse358 .cse2) .cse6))) (let ((.cse360 (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse361 4 v_DerPreprocessor_11) 0 .cse2)) .cse359 v_prenex_342) .cse356) .cse3))) (let ((.cse357 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_339) .cse359 v_prenex_340) .cse360))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse357 (+ v_prenex_341 4))) (not (= .cse2 (select (select .cse358 .cse359) v_prenex_338))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse357 (+ v_prenex_337 4))) (= .cse360 .cse356))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse364 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_204 Int) (v_prenex_205 Int) (v_DerPreprocessor_11 Int) (v_prenex_167 (Array Int Int)) (v_prenex_168 (Array Int Int)) (v_prenex_169 (Array Int Int))) (let ((.cse363 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse365 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse363 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse362 (select (select .cse365 .cse2) .cse6))) (or (= .cse3 v_prenex_205) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_167) .cse362 v_prenex_168) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse363 4 v_DerPreprocessor_11) 0 .cse2)) .cse362 v_prenex_169) .cse364) .cse3)) (+ v_prenex_205 4))) (= .cse362 .cse364) (not (= (select (select .cse365 .cse362) v_prenex_204) .cse2))))))) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse364)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse369 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_269 Int) (v_prenex_113 Int) (v_prenex_111 (Array Int Int)) (v_prenex_112 (Array Int Int)) (v_prenex_114 (Array Int Int))) (let ((.cse370 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse368 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse370 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse366 (select (select .cse368 .cse2) .cse6))) (let ((.cse367 (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse370 4 v_DerPreprocessor_11) 0 .cse2)) .cse366 v_prenex_114) .cse369) .cse3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_111) .cse366 v_prenex_112) .cse367) (+ v_prenex_113 4))) (not (= (select (select .cse368 .cse366) v_prenex_269) .cse2)) (= .cse366 .cse369) (= .cse367 .cse369))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse369)))) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_231 Int) (v_prenex_230 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_232 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_228 Int) (v_prenex_229 Int)) (let ((.cse375 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse372 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse375 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse373 (select (select .cse372 .cse2) .cse6)) (.cse374 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse371 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_230) .cse373 v_prenex_232) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse375 4 v_DerPreprocessor_11) 0 .cse2)) .cse373 v_prenex_233) .cse374) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse371 (+ v_prenex_228 4))) (not (= (select (select .cse372 .cse373) v_prenex_229) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse371 (+ v_prenex_231 4))) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse374) (= .cse3 v_prenex_228) (= .cse3 v_prenex_231))))))) .cse23) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_155 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_154 (Array Int Int)) (v_prenex_274 Int) (v_prenex_156 (Array Int Int)) (v_prenex_157 (Array Int Int))) (let ((.cse379 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse376 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse379 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse377 (select (select .cse376 .cse2) .cse6)) (.cse378 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse376 .cse377) v_prenex_274) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= .cse377 .cse378) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse378) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_154) .cse377 v_prenex_156) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse379 4 v_DerPreprocessor_11) 0 .cse2)) .cse377 v_prenex_157) .cse378) .cse3)) (+ v_prenex_155 4))) (= .cse3 v_prenex_155)))))) .cse23) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_209 (Array Int Int)) (v_prenex_221 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_210 (Array Int Int)) (v_prenex_211 (Array Int Int)) (v_prenex_391 Int)) (let ((.cse382 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse380 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse382 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse381 (select (select .cse380 .cse2) .cse6)) (.cse383 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse380 .cse381) v_prenex_391) .cse2)) (= .cse3 v_prenex_391) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_209) .cse381 v_prenex_210) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse382 4 v_DerPreprocessor_11) 0 .cse2)) .cse381 v_prenex_211) .cse383) .cse3)) (+ v_prenex_221 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse383) (= .cse3 v_prenex_221)))))) .cse23) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse384 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse384) (forall ((v_DerPreprocessor_11 Int) (v_prenex_274 Int)) (let ((.cse388 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse385 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse388 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse386 (select (select .cse385 .cse2) .cse6))) (or (not (= (select (select .cse385 .cse386) v_prenex_274) .cse2)) (= .cse386 .cse384) (forall ((v_prenex_163 (Array Int Int)) (v_prenex_165 (Array Int Int)) (v_prenex_166 (Array Int Int)) (v_prenex_164 Int)) (let ((.cse387 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_163) .cse386 v_prenex_165) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse388 4 v_DerPreprocessor_11) 0 .cse2)) .cse386 v_prenex_166) .cse384) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse387 .cse11)) (= .cse3 v_prenex_164) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse387 (+ v_prenex_164 4)))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse390 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int)) (let ((.cse391 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse392 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse391 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse389 (select (select .cse392 .cse2) .cse6))) (or (not (= .cse389 .cse390)) (forall ((v_prenex_76 (Array Int Int)) (v_prenex_75 (Array Int Int)) (v_prenex_74 Int) (v_prenex_77 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_75) .cse389 v_prenex_76) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse391 4 v_DerPreprocessor_11) 0 .cse2)) .cse389 v_prenex_77) .cse390) .cse3)) (+ v_prenex_74 4)) |c_ULTIMATE.start_main_~data~0#1|) (= .cse3 v_prenex_74))) (not (= (select (select .cse392 .cse389) .cse3) .cse2))))))) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse390)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (forall ((v_prenex_402 Int)) (or (forall ((v_DerPreprocessor_11 Int)) (let ((.cse397 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse398 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse397 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse396 (select (select .cse398 .cse2) .cse6))) (or (forall ((v_prenex_415 (Array Int Int)) (v_prenex_416 (Array Int Int)) (v_prenex_417 (Array Int Int)) (v_prenex_409 Int)) (let ((.cse395 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse394 (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse397 4 v_DerPreprocessor_11) 0 .cse2)) .cse396 v_prenex_417) .cse395) .cse3))) (let ((.cse393 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_415) .cse396 v_prenex_416) .cse394))) (or (= (select .cse393 (+ v_prenex_409 4)) |c_ULTIMATE.start_main_~data~0#1|) (= .cse394 .cse395) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse393 .cse11))))))) (not (= (select (select .cse398 .cse396) v_prenex_402) .cse2))))))) (= .cse3 v_prenex_402))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)))) (or .cse29 (and .cse308 .cse309 (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_155 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_154 (Array Int Int)) (v_prenex_274 Int) (v_prenex_156 (Array Int Int)) (v_prenex_157 (Array Int Int))) (let ((.cse402 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse399 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse402 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse400 (select (select .cse399 .cse2) .cse6)) (.cse401 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse399 .cse400) v_prenex_274) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= .cse400 .cse401) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_154) .cse400 v_prenex_156) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse402 4 v_DerPreprocessor_11) 0 .cse2)) .cse400 v_prenex_157) .cse401) .cse3)) (+ v_prenex_155 4))) (= .cse3 v_prenex_155)))))) .cse23) (or .cse34 (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse405 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_274 Int)) (let ((.cse406 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse403 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse406 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse404 (select (select .cse403 .cse2) .cse6))) (or (not (= (select (select .cse403 .cse404) v_prenex_274) .cse2)) (= .cse404 .cse405) (forall ((v_prenex_126 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_126) .cse404 v_prenex_127) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse406 4 v_DerPreprocessor_11) 0 .cse2)) .cse404 v_prenex_128) .cse405) 0)) .cse11)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse405))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse409 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_274 Int)) (let ((.cse411 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse407 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse411 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse408 (select (select .cse407 .cse2) .cse6))) (or (not (= (select (select .cse407 .cse408) v_prenex_274) .cse2)) (= .cse408 .cse409) (forall ((v_prenex_122 Int) (v_prenex_123 (Array Int Int)) (v_prenex_124 (Array Int Int)) (v_prenex_125 (Array Int Int))) (let ((.cse410 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_123) .cse408 v_prenex_124) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse411 4 v_DerPreprocessor_11) 0 .cse2)) .cse408 v_prenex_125) .cse409) 0)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse410 (+ v_prenex_122 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse410 .cse11)))))))))) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse409))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse414 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_274 Int)) (let ((.cse416 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse412 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse416 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse413 (select (select .cse412 .cse2) .cse6))) (or (not (= (select (select .cse412 .cse413) v_prenex_274) .cse2)) (= .cse413 .cse414) (forall ((v_prenex_142 (Array Int Int)) (v_prenex_143 (Array Int Int)) (v_prenex_141 Int) (v_prenex_144 (Array Int Int)) (v_prenex_140 Int)) (let ((.cse415 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_142) .cse413 v_prenex_143) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse416 4 v_DerPreprocessor_11) 0 .cse2)) .cse413 v_prenex_144) .cse414) 0)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse415 .cse11)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse415 (+ v_prenex_140 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse415 (+ v_prenex_141 4))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse414))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse417 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse417)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_274 Int)) (let ((.cse421 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse418 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse421 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse419 (select (select .cse418 .cse2) .cse6))) (or (not (= (select (select .cse418 .cse419) v_prenex_274) .cse2)) (forall ((v_prenex_129 (Array Int Int)) (v_prenex_131 (Array Int Int)) (v_prenex_132 (Array Int Int)) (v_prenex_130 Int)) (let ((.cse420 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_129) .cse419 v_prenex_131) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse421 4 v_DerPreprocessor_11) 0 .cse2)) .cse419 v_prenex_132) .cse417) 0)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse420 (+ v_prenex_130 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse420 .cse11))))) (= .cse419 .cse417))))))))))) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_136 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_274 Int) (v_prenex_137 (Array Int Int)) (v_prenex_138 (Array Int Int)) (v_prenex_139 (Array Int Int))) (let ((.cse426 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse423 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse426 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse424 (select (select .cse423 .cse2) .cse6)) (.cse425 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse422 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_137) .cse424 v_prenex_138) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse426 4 v_DerPreprocessor_11) 0 .cse2)) .cse424 v_prenex_139) .cse425) 0)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse422 .cse11)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse422 (+ v_prenex_136 4))) (not (= (select (select .cse423 .cse424) v_prenex_274) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= .cse424 .cse425) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse425)))))))) .cse34) (or .cse34 (forall ((v_DerPreprocessor_11 Int) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_275 (Array Int Int)) (v_prenex_276 (Array Int Int)) (v_prenex_274 Int) (v_prenex_277 (Array Int Int))) (let ((.cse429 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse427 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse429 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse428 (select (select .cse427 .cse2) .cse6)) (.cse430 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse427 .cse428) v_prenex_274) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_275) .cse428 v_prenex_276) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse429 4 v_DerPreprocessor_11) 0 .cse2)) .cse428 v_prenex_277) .cse430) 0)) .cse11)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= .cse428 .cse430) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse430)))))))) (or .cse23 (forall ((v_prenex_149 Int) (v_DerPreprocessor_11 Int) (v_prenex_150 (Array Int Int)) (v_prenex_152 (Array Int Int)) (v_prenex_153 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int) (v_prenex_274 Int) (v_prenex_151 Int)) (let ((.cse435 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse431 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse435 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse432 (select (select .cse431 .cse2) .cse6)) (.cse433 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse434 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_150) .cse432 v_prenex_152) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse435 4 v_DerPreprocessor_11) 0 .cse2)) .cse432 v_prenex_153) .cse433) .cse3)))) (or (not (= (select (select .cse431 .cse432) v_prenex_274) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= .cse432 .cse433) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse434 (+ v_prenex_149 4))) (= .cse3 v_prenex_151) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse434 (+ v_prenex_151 4)))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_398 Int) (v_prenex_399 (Array Int Int)) (v_prenex_400 (Array Int Int)) (v_prenex_401 (Array Int Int))) (let ((.cse440 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse439 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse440 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse436 (select (select .cse439 .cse2) .cse6)) (.cse437 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse438 (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse440 4 v_DerPreprocessor_11) 0 .cse2)) .cse436 v_prenex_401) .cse437) .cse3))) (or (not (= .cse436 .cse437)) (= .cse438 .cse437) (not (= (select (select .cse439 .cse436) .cse3) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_399) .cse436 v_prenex_400) .cse438) (+ v_prenex_398 4))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse445 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (forall ((v_prenex_391 Int)) (or (= .cse3 v_prenex_391) (forall ((v_DerPreprocessor_11 Int)) (let ((.cse444 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse441 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse444 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse442 (select (select .cse441 .cse2) .cse6))) (or (not (= (select (select .cse441 .cse442) v_prenex_391) .cse2)) (forall ((v_prenex_220 Int) (v_prenex_212 (Array Int Int)) (v_prenex_213 (Array Int Int)) (v_prenex_214 (Array Int Int))) (let ((.cse443 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_212) .cse442 v_prenex_213) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse444 4 v_DerPreprocessor_11) 0 .cse2)) .cse442 v_prenex_214) .cse445) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse443 (+ v_prenex_220 4))) (= .cse3 v_prenex_220) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse443 .cse11)))))))))))) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse445)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| Int)) (let ((.cse448 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_274 Int)) (let ((.cse450 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (let ((.cse446 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse450 0 0) 4 v_DerPreprocessor_11)))) (let ((.cse447 (select (select .cse446 .cse2) .cse6))) (or (not (= (select (select .cse446 .cse447) v_prenex_274) .cse2)) (= .cse447 .cse448) (forall ((v_prenex_279 Int) (v_prenex_278 Int) (v_prenex_133 (Array Int Int)) (v_prenex_134 (Array Int Int)) (v_prenex_135 (Array Int Int))) (let ((.cse449 (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_prenex_133) .cse447 v_prenex_134) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store (store .cse450 4 v_DerPreprocessor_11) 0 .cse2)) .cse447 v_prenex_135) .cse448) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse449 (+ v_prenex_278 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse449 (+ v_prenex_279 4))) (= .cse3 v_prenex_278) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse449 .cse11)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) 0)) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| .cse448))))))))) is different from true [2023-11-29 01:13:23,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879171079] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:13:23,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:13:23,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 34] total 59 [2023-11-29 01:13:23,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987205617] [2023-11-29 01:13:23,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:13:23,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-11-29 01:13:23,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:13:23,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-11-29 01:13:23,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=4387, Unknown=64, NotChecked=834, Total=5550 [2023-11-29 01:13:23,282 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 59 states, 50 states have (on average 1.76) internal successors, (88), 50 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:13:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:13:36,937 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2023-11-29 01:13:36,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-29 01:13:36,938 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 50 states have (on average 1.76) internal successors, (88), 50 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2023-11-29 01:13:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:13:36,938 INFO L225 Difference]: With dead ends: 82 [2023-11-29 01:13:36,938 INFO L226 Difference]: Without dead ends: 82 [2023-11-29 01:13:36,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1979 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=511, Invalid=7819, Unknown=66, NotChecked=1110, Total=9506 [2023-11-29 01:13:36,941 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 111 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:13:36,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1170 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1635 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-11-29 01:13:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-29 01:13:36,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-29 01:13:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:13:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2023-11-29 01:13:36,945 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 52 [2023-11-29 01:13:36,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:13:36,946 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2023-11-29 01:13:36,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 50 states have (on average 1.76) internal successors, (88), 50 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:13:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2023-11-29 01:13:36,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 01:13:36,947 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:13:36,947 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:13:36,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 01:13:37,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:13:37,148 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:13:37,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:13:37,148 INFO L85 PathProgramCache]: Analyzing trace with hash -978875876, now seen corresponding path program 2 times [2023-11-29 01:13:37,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:13:37,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373412569] [2023-11-29 01:13:37,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:13:37,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:13:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:44,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:13:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:44,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:13:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:45,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:13:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:13:46,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:13:46,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373412569] [2023-11-29 01:13:46,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373412569] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:13:46,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107512255] [2023-11-29 01:13:46,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:13:46,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:13:46,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:13:46,688 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:13:46,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-29 01:13:46,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:13:46,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:13:46,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 150 conjunts are in the unsatisfiable core [2023-11-29 01:13:46,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:13:47,189 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-29 01:13:49,267 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:13:49,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 01:13:49,365 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 01:13:49,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-29 01:13:50,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:13:50,122 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-29 01:13:50,606 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 01:13:50,606 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 101 treesize of output 70 [2023-11-29 01:13:50,617 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 59 treesize of output 32 [2023-11-29 01:13:51,060 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 53 treesize of output 29 [2023-11-29 01:13:51,070 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 27 treesize of output 11 [2023-11-29 01:13:51,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:13:51,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:13:52,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:13:52,696 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 61 treesize of output 44 [2023-11-29 01:13:52,767 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 01:13:52,767 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-29 01:13:52,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-11-29 01:13:52,804 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 43 treesize of output 32 [2023-11-29 01:13:56,884 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:13:56,885 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:13:56,886 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 57 [2023-11-29 01:13:56,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2023-11-29 01:13:57,525 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 108 treesize of output 61 [2023-11-29 01:13:57,643 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 01:13:57,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 01:13:58,150 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-11-29 01:13:58,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 88 [2023-11-29 01:13:58,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:13:58,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 54 [2023-11-29 01:13:59,835 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 120 treesize of output 80 [2023-11-29 01:14:00,942 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:14:00,942 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 85 treesize of output 44 [2023-11-29 01:14:00,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-11-29 01:14:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:14:01,306 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:14:04,155 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_3957 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3957))) (let ((.cse2 (select (select .cse0 .cse4) .cse5))) (or (forall ((v_ArrVal_3956 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3956))) (let ((.cse1 (select (select .cse3 .cse4) .cse5))) (<= (+ (select (select .cse0 .cse1) .cse2) 8) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (= .cse2 .cse5))))) (forall ((v_ArrVal_3956 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3956) .cse4) .cse5))) (or (forall ((v_ArrVal_3957 (Array Int Int))) (<= 0 (+ (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3957))) (select (select .cse6 .cse7) (select (select .cse6 .cse4) .cse5))) 4))) (= .cse4 .cse7)))) (forall ((v_ArrVal_3957 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3957))) (let ((.cse8 (select (select .cse9 .cse4) .cse5))) (or (= .cse8 .cse5) (forall ((v_ArrVal_3956 (Array Int Int))) (<= 0 (+ (select (select .cse9 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3956) .cse4) .cse5)) .cse8) 4))))))) (forall ((v_ArrVal_3956 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3956))) (let ((.cse11 (select (select .cse13 .cse4) .cse5))) (or (forall ((v_ArrVal_3957 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3957))) (let ((.cse12 (select (select .cse10 .cse4) .cse5))) (<= (+ (select (select .cse10 .cse11) .cse12) 8) (select |c_#length| (select (select .cse13 .cse11) .cse12)))))) (= .cse4 .cse11))))))) is different from false [2023-11-29 01:14:04,259 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (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|)) (.cse3 (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|))) (and (forall ((v_ArrVal_3956 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3956) .cse2) .cse3))) (or (forall ((v_ArrVal_3957 (Array Int Int))) (<= 0 (+ (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3957))) (select (select .cse0 .cse1) (select (select .cse0 .cse2) .cse3))) 4))) (= .cse1 .cse2)))) (forall ((v_ArrVal_3956 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3956))) (let ((.cse5 (select (select .cse7 .cse2) .cse3))) (or (forall ((v_ArrVal_3957 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3957))) (let ((.cse6 (select (select .cse4 .cse2) .cse3))) (<= (+ (select (select .cse4 .cse5) .cse6) 8) (select |c_#length| (select (select .cse7 .cse5) .cse6)))))) (= .cse5 .cse2))))) (forall ((v_ArrVal_3957 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3957))) (let ((.cse9 (select (select .cse8 .cse2) .cse3))) (or (forall ((v_ArrVal_3956 (Array Int Int))) (<= 0 (+ (select (select .cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3956) .cse2) .cse3)) .cse9) 4))) (= .cse3 .cse9))))) (forall ((v_ArrVal_3957 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3957))) (let ((.cse12 (select (select .cse10 .cse2) .cse3))) (or (forall ((v_ArrVal_3956 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3956))) (let ((.cse11 (select (select .cse13 .cse2) .cse3))) (<= (+ (select (select .cse10 .cse11) .cse12) 8) (select |c_#length| (select (select .cse13 .cse11) .cse12)))))) (= .cse3 .cse12))))))) is different from false [2023-11-29 01:14:04,376 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem15#1.offset|))) (.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem15#1.base|))) (.cse4 (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|)) (.cse5 (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|))) (and (forall ((v_ArrVal_3956 (Array Int Int))) (let ((.cse3 (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3956))) (let ((.cse1 (select (select .cse3 .cse4) .cse5))) (or (forall ((v_ArrVal_3957 (Array Int Int))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3957))) (let ((.cse2 (select (select .cse0 .cse4) .cse5))) (<= (+ 8 (select (select .cse0 .cse1) .cse2)) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (= .cse1 .cse4))))) (forall ((v_ArrVal_3957 (Array Int Int))) (let ((.cse8 (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3957))) (let ((.cse10 (select (select .cse8 .cse4) .cse5))) (or (forall ((v_ArrVal_3956 (Array Int Int))) (let ((.cse11 (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3956))) (let ((.cse9 (select (select .cse11 .cse4) .cse5))) (<= (+ 8 (select (select .cse8 .cse9) .cse10)) (select |c_#length| (select (select .cse11 .cse9) .cse10)))))) (= .cse5 .cse10))))) (forall ((v_ArrVal_3957 (Array Int Int))) (let ((.cse13 (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3957))) (let ((.cse12 (select (select .cse13 .cse4) .cse5))) (or (= .cse5 .cse12) (forall ((v_ArrVal_3956 (Array Int Int))) (<= 0 (+ 4 (select (select .cse13 (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3956) .cse4) .cse5)) .cse12)))))))) (forall ((v_ArrVal_3956 (Array Int Int))) (let ((.cse15 (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3956) .cse4) .cse5))) (or (forall ((v_ArrVal_3957 (Array Int Int))) (<= 0 (+ 4 (let ((.cse14 (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3957))) (select (select .cse14 .cse15) (select (select .cse14 .cse4) .cse5)))))) (= .cse15 .cse4)))))) is different from false [2023-11-29 01:14:07,701 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse18 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse18 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse18 |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|)) (.cse5 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse17 |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|)) (.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse17 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (.cse7 (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|))) (and (forall ((v_ArrVal_3956 (Array Int Int))) (let ((.cse3 (store .cse8 .cse7 v_ArrVal_3956))) (let ((.cse1 (select (select .cse3 .cse4) .cse5))) (or (forall ((v_ArrVal_3957 (Array Int Int))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_3957))) (let ((.cse2 (select (select .cse0 .cse4) .cse5))) (<= (+ (select (select .cse0 .cse1) .cse2) 8) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (= .cse1 .cse4))))) (forall ((v_ArrVal_3956 (Array Int Int))) (let ((.cse9 (select (select (store .cse8 .cse7 v_ArrVal_3956) .cse4) .cse5))) (or (= .cse9 .cse4) (forall ((v_ArrVal_3957 (Array Int Int))) (<= 0 (+ (let ((.cse10 (store .cse6 .cse7 v_ArrVal_3957))) (select (select .cse10 .cse9) (select (select .cse10 .cse4) .cse5))) 4)))))) (forall ((v_ArrVal_3957 (Array Int Int))) (let ((.cse11 (store .cse6 .cse7 v_ArrVal_3957))) (let ((.cse12 (select (select .cse11 .cse4) .cse5))) (or (forall ((v_ArrVal_3956 (Array Int Int))) (<= 0 (+ (select (select .cse11 (select (select (store .cse8 .cse7 v_ArrVal_3956) .cse4) .cse5)) .cse12) 4))) (= .cse5 .cse12))))) (forall ((v_ArrVal_3957 (Array Int Int))) (let ((.cse14 (store .cse6 .cse7 v_ArrVal_3957))) (let ((.cse13 (select (select .cse14 .cse4) .cse5))) (or (= .cse5 .cse13) (forall ((v_ArrVal_3956 (Array Int Int))) (let ((.cse16 (store .cse8 .cse7 v_ArrVal_3956))) (let ((.cse15 (select (select .cse16 .cse4) .cse5))) (<= (+ (select (select .cse14 .cse15) .cse13) 8) (select |c_#length| (select (select .cse16 .cse15) .cse13))))))))))))) is different from false [2023-11-29 01:14:11,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:14:11,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1183 treesize of output 1110 [2023-11-29 01:14:16,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107512255] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:14:16,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:14:16,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 63 [2023-11-29 01:14:16,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139473384] [2023-11-29 01:14:16,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:14:16,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-11-29 01:14:16,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:14:16,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-11-29 01:14:16,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=5283, Unknown=37, NotChecked=596, Total=6162 [2023-11-29 01:14:16,186 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 64 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 55 states have internal predecessors, (94), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:14:36,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:14:36,882 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2023-11-29 01:14:36,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-29 01:14:36,882 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 55 states have internal predecessors, (94), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2023-11-29 01:14:36,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:14:36,883 INFO L225 Difference]: With dead ends: 117 [2023-11-29 01:14:36,883 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 01:14:36,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1800 ImplicationChecksByTransitivity, 40.5s TimeCoverageRelationStatistics Valid=604, Invalid=10291, Unknown=41, NotChecked=836, Total=11772 [2023-11-29 01:14:36,885 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 370 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:14:36,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1285 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2023-11-29 01:14:36,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 01:14:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 87. [2023-11-29 01:14:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 81 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:14:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2023-11-29 01:14:36,888 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 53 [2023-11-29 01:14:36,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:14:36,888 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2023-11-29 01:14:36,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 55 states have internal predecessors, (94), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:14:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2023-11-29 01:14:36,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 01:14:36,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:14:36,889 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:14:36,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-11-29 01:14:37,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-29 01:14:37,090 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:14:37,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:14:37,090 INFO L85 PathProgramCache]: Analyzing trace with hash -978875877, now seen corresponding path program 2 times [2023-11-29 01:14:37,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:14:37,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343169839] [2023-11-29 01:14:37,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:14:37,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:14:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:41,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:14:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:41,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:14:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:42,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:14:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:14:42,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:14:42,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343169839] [2023-11-29 01:14:42,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343169839] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:14:42,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395125293] [2023-11-29 01:14:42,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:14:42,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:14:42,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:14:42,878 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:14:42,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-29 01:14:43,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:14:43,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:14:43,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 99 conjunts are in the unsatisfiable core [2023-11-29 01:14:43,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:14:50,616 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:14:50,668 INFO L349 Elim1Store]: treesize reduction 29, result has 44.2 percent of original size [2023-11-29 01:14:50,668 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 72 treesize of output 67 [2023-11-29 01:14:50,701 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:14:50,750 INFO L349 Elim1Store]: treesize reduction 29, result has 44.2 percent of original size [2023-11-29 01:14:50,750 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 60 treesize of output 55 [2023-11-29 01:14:51,404 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 95 treesize of output 63 [2023-11-29 01:14:51,419 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:14:51,510 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-29 01:14:51,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 82 [2023-11-29 01:14:52,290 INFO L349 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2023-11-29 01:14:52,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 85 [2023-11-29 01:14:52,417 INFO L349 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2023-11-29 01:14:52,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 40 [2023-11-29 01:15:12,733 WARN L293 SmtUtils]: Spent 13.31s on a formula simplification. DAG size of input: 718 DAG size of output: 678 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 01:15:12,734 INFO L349 Elim1Store]: treesize reduction 204, result has 93.5 percent of original size [2023-11-29 01:15:12,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 21 new quantified variables, introduced 153 case distinctions, treesize of input 707 treesize of output 3436 [2023-11-29 01:20:18,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 01:20:18,767 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 01:20:18,769 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 01:20:18,774 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-11-29 01:20:18,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-29 01:20:18,970 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:495) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 60 more [2023-11-29 01:20:18,972 INFO L158 Benchmark]: Toolchain (without parser) took 620745.77ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 111.1MB in the beginning and 155.6MB in the end (delta: -44.5MB). Peak memory consumption was 248.1MB. Max. memory is 16.1GB. [2023-11-29 01:20:18,973 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 99.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:20:18,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.97ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 93.2MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 01:20:18,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.22ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 90.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:20:18,973 INFO L158 Benchmark]: Boogie Preprocessor took 52.42ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 87.2MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:20:18,974 INFO L158 Benchmark]: RCFGBuilder took 614.85ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 87.2MB in the beginning and 130.8MB in the end (delta: -43.6MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2023-11-29 01:20:18,974 INFO L158 Benchmark]: TraceAbstraction took 619617.65ms. Allocated memory was 172.0MB in the beginning and 360.7MB in the end (delta: 188.7MB). Free memory was 130.0MB in the beginning and 155.6MB in the end (delta: -25.6MB). Peak memory consumption was 235.9MB. Max. memory is 16.1GB. [2023-11-29 01:20:18,975 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 99.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.97ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 93.2MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.22ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 90.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.42ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 87.2MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 614.85ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 87.2MB in the beginning and 130.8MB in the end (delta: -43.6MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 619617.65ms. Allocated memory was 172.0MB in the beginning and 360.7MB in the end (delta: 188.7MB). Free memory was 130.0MB in the beginning and 155.6MB in the end (delta: -25.6MB). Peak memory consumption was 235.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:20:20,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:20:20,926 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 01:20:20,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:20:20,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:20:20,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:20:20,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:20:20,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:20:20,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:20:20,988 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:20:20,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:20:20,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:20:20,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:20:20,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:20:20,993 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:20:20,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:20:20,994 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:20:20,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:20:20,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:20:20,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:20:20,996 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:20:20,997 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:20:20,997 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:20:20,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:20:20,998 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:20:20,999 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:20:20,999 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:20:21,000 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:20:21,000 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:20:21,001 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:20:21,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:20:21,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:20:21,002 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:20:21,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:20:21,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:20:21,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:20:21,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:20:21,004 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:20:21,004 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:20:21,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:20:21,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:20:21,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:20:21,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:20:21,006 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:20:21,006 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_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/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_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2023-11-29 01:20:21,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:20:21,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:20:21,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:20:21,445 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:20:21,446 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:20:21,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-29 01:20:24,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:20:25,217 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:20:25,218 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-29 01:20:25,237 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/data/9ac532f07/ddb72cfce79740b9b6e294ce3d089797/FLAGa15ec7713 [2023-11-29 01:20:25,256 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/data/9ac532f07/ddb72cfce79740b9b6e294ce3d089797 [2023-11-29 01:20:25,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:20:25,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:20:25,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:20:25,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:20:25,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:20:25,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:20:25" (1/1) ... [2023-11-29 01:20:25,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ccfa18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:20:25, skipping insertion in model container [2023-11-29 01:20:25,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:20:25" (1/1) ... [2023-11-29 01:20:25,326 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:20:25,653 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:20:25,671 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:20:25,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:20:25,762 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:20:25,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:20:25 WrapperNode [2023-11-29 01:20:25,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:20:25,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:20:25,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:20:25,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:20:25,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:20:25" (1/1) ... [2023-11-29 01:20:25,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:20:25" (1/1) ... [2023-11-29 01:20:25,830 INFO L138 Inliner]: procedures = 130, calls = 44, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 150 [2023-11-29 01:20:25,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:20:25,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:20:25,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:20:25,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:20:25,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:20:25" (1/1) ... [2023-11-29 01:20:25,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:20:25" (1/1) ... [2023-11-29 01:20:25,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:20:25" (1/1) ... [2023-11-29 01:20:25,879 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 13, 10]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 7, 2]. [2023-11-29 01:20:25,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:20:25" (1/1) ... [2023-11-29 01:20:25,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:20:25" (1/1) ... [2023-11-29 01:20:25,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:20:25" (1/1) ... [2023-11-29 01:20:25,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:20:25" (1/1) ... [2023-11-29 01:20:25,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:20:25" (1/1) ... [2023-11-29 01:20:25,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:20:25" (1/1) ... [2023-11-29 01:20:25,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:20:25,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:20:25,943 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:20:25,944 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:20:25,945 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:20:25" (1/1) ... [2023-11-29 01:20:25,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:20:25,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:20:26,005 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:20:26,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:20:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 01:20:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 01:20:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 01:20:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 01:20:26,046 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 01:20:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:20:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:20:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:20:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:20:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:20:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 01:20:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:20:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:20:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 01:20:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:20:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 01:20:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 01:20:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 01:20:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 01:20:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 01:20:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 01:20:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:20:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 01:20:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 01:20:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:20:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:20:26,238 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:20:26,240 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:20:26,904 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:20:26,974 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:20:26,974 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 01:20:26,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:20:26 BoogieIcfgContainer [2023-11-29 01:20:26,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:20:26,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:20:26,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:20:26,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:20:26,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:20:25" (1/3) ... [2023-11-29 01:20:26,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ccf21af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:20:26, skipping insertion in model container [2023-11-29 01:20:26,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:20:25" (2/3) ... [2023-11-29 01:20:26,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ccf21af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:20:26, skipping insertion in model container [2023-11-29 01:20:26,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:20:26" (3/3) ... [2023-11-29 01:20:26,987 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2023-11-29 01:20:27,024 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:20:27,024 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2023-11-29 01:20:27,073 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:20:27,081 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@18187a9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:20:27,081 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-11-29 01:20:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 50 states have (on average 2.32) internal successors, (116), 102 states have internal predecessors, (116), 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-29 01:20:27,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 01:20:27,094 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:20:27,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:20:27,096 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:20:27,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:27,102 INFO L85 PathProgramCache]: Analyzing trace with hash 233264712, now seen corresponding path program 1 times [2023-11-29 01:20:27,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:20:27,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045917537] [2023-11-29 01:20:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:27,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:27,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:20:27,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:20:27,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 01:20:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:27,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:20:27,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:27,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:20:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:20:27,324 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:20:27,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:20:27,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045917537] [2023-11-29 01:20:27,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045917537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:20:27,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:20:27,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:20:27,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181838628] [2023-11-29 01:20:27,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:20:27,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:20:27,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:20:27,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:20:27,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:20:27,365 INFO L87 Difference]: Start difference. First operand has 107 states, 50 states have (on average 2.32) internal successors, (116), 102 states have internal predecessors, (116), 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 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:20:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:27,692 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2023-11-29 01:20:27,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:20:27,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 01:20:27,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:20:27,706 INFO L225 Difference]: With dead ends: 104 [2023-11-29 01:20:27,706 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 01:20:27,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:20:27,713 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:20:27,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 148 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:20:27,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 01:20:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-29 01:20:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 97 states have internal predecessors, (104), 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-29 01:20:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2023-11-29 01:20:27,767 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 5 [2023-11-29 01:20:27,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:20:27,768 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2023-11-29 01:20:27,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:20:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2023-11-29 01:20:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 01:20:27,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:20:27,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:20:27,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:20:27,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:27,971 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:20:27,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:27,972 INFO L85 PathProgramCache]: Analyzing trace with hash 233264713, now seen corresponding path program 1 times [2023-11-29 01:20:27,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:20:27,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328145772] [2023-11-29 01:20:27,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:27,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:27,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:20:27,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:20:27,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 01:20:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:28,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:20:28,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:28,071 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-29 01:20:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:20:28,097 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:20:28,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:20:28,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328145772] [2023-11-29 01:20:28,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328145772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:20:28,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:20:28,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:20:28,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005852361] [2023-11-29 01:20:28,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:20:28,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:20:28,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:20:28,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:20:28,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:20:28,102 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:20:28,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:28,474 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2023-11-29 01:20:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:20:28,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 01:20:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:20:28,476 INFO L225 Difference]: With dead ends: 100 [2023-11-29 01:20:28,477 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 01:20:28,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:20:28,479 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:20:28,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 153 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:20:28,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 01:20:28,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-29 01:20:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 2.125) internal successors, (102), 95 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:20:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2023-11-29 01:20:28,492 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 5 [2023-11-29 01:20:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:20:28,492 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2023-11-29 01:20:28,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:20:28,493 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2023-11-29 01:20:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 01:20:28,493 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:20:28,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:20:28,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 01:20:28,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:28,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:20:28,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:28,696 INFO L85 PathProgramCache]: Analyzing trace with hash -791732290, now seen corresponding path program 1 times [2023-11-29 01:20:28,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:20:28,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316276006] [2023-11-29 01:20:28,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:28,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:28,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:20:28,700 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:20:28,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 01:20:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:28,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:20:28,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:20:28,845 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:20:28,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:20:28,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316276006] [2023-11-29 01:20:28,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316276006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:20:28,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:20:28,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:20:28,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199294351] [2023-11-29 01:20:28,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:20:28,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:20:28,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:20:28,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:20:28,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:20:28,848 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 01:20:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:29,001 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2023-11-29 01:20:29,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:20:29,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-11-29 01:20:29,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:20:29,005 INFO L225 Difference]: With dead ends: 106 [2023-11-29 01:20:29,005 INFO L226 Difference]: Without dead ends: 106 [2023-11-29 01:20:29,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:20:29,008 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:20:29,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 185 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:20:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-29 01:20:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2023-11-29 01:20:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 96 states have internal predecessors, (103), 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-29 01:20:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2023-11-29 01:20:29,023 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 10 [2023-11-29 01:20:29,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:20:29,024 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2023-11-29 01:20:29,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 01:20:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2023-11-29 01:20:29,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 01:20:29,025 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:20:29,026 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:20:29,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 01:20:29,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:29,228 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:20:29,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:29,229 INFO L85 PathProgramCache]: Analyzing trace with hash 434569947, now seen corresponding path program 1 times [2023-11-29 01:20:29,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:20:29,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619021233] [2023-11-29 01:20:29,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:29,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:29,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:20:29,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:20:29,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 01:20:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:29,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:20:29,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:29,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:20:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:20:29,451 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:20:29,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:20:29,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619021233] [2023-11-29 01:20:29,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619021233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:20:29,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:20:29,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:20:29,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488898433] [2023-11-29 01:20:29,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:20:29,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:20:29,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:20:29,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:20:29,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:20:29,455 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:20:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:30,105 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2023-11-29 01:20:30,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:20:30,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-29 01:20:30,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:20:30,107 INFO L225 Difference]: With dead ends: 100 [2023-11-29 01:20:30,107 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 01:20:30,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:20:30,110 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:20:30,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 298 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:20:30,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 01:20:30,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-29 01:20:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 95 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:20:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2023-11-29 01:20:30,122 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 17 [2023-11-29 01:20:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:20:30,122 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2023-11-29 01:20:30,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:20:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2023-11-29 01:20:30,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 01:20:30,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:20:30,124 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:20:30,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 01:20:30,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:30,325 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:20:30,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:30,327 INFO L85 PathProgramCache]: Analyzing trace with hash 434569948, now seen corresponding path program 1 times [2023-11-29 01:20:30,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:20:30,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469978711] [2023-11-29 01:20:30,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:30,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:30,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:20:30,331 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:20:30,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 01:20:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:30,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 01:20:30,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:30,479 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-29 01:20:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:20:30,590 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:20:30,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:20:30,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469978711] [2023-11-29 01:20:30,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469978711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:20:30,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:20:30,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:20:30,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237289381] [2023-11-29 01:20:30,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:20:30,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:20:30,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:20:30,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:20:30,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:20:30,595 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:20:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:31,284 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2023-11-29 01:20:31,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:20:31,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-29 01:20:31,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:20:31,287 INFO L225 Difference]: With dead ends: 99 [2023-11-29 01:20:31,287 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 01:20:31,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:20:31,288 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:20:31,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 322 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:20:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 01:20:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-29 01:20:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 49 states have (on average 2.061224489795918) internal successors, (101), 94 states have internal predecessors, (101), 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-29 01:20:31,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2023-11-29 01:20:31,298 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 17 [2023-11-29 01:20:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:20:31,299 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2023-11-29 01:20:31,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:20:31,299 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2023-11-29 01:20:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 01:20:31,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:20:31,300 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:20:31,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 01:20:31,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:31,504 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:20:31,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:31,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1010083920, now seen corresponding path program 1 times [2023-11-29 01:20:31,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:20:31,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517434749] [2023-11-29 01:20:31,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:31,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:31,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:20:31,507 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:20:31,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 01:20:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:31,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 01:20:31,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:31,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:20:31,770 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-29 01:20:31,850 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 01:20:31,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 01:20:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-29 01:20:31,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:20:32,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:20:32,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517434749] [2023-11-29 01:20:32,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517434749] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:20:32,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:20:32,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2023-11-29 01:20:32,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337888548] [2023-11-29 01:20:32,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:20:32,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:20:32,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:20:32,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:20:32,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2023-11-29 01:20:32,153 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:20:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:32,971 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2023-11-29 01:20:32,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:20:32,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2023-11-29 01:20:32,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:20:32,973 INFO L225 Difference]: With dead ends: 98 [2023-11-29 01:20:32,973 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 01:20:32,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=67, Unknown=1, NotChecked=16, Total=110 [2023-11-29 01:20:32,975 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 2 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:20:32,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 331 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 283 Invalid, 0 Unknown, 101 Unchecked, 0.7s Time] [2023-11-29 01:20:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 01:20:32,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-29 01:20:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 93 states have internal predecessors, (100), 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-29 01:20:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2023-11-29 01:20:32,985 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 19 [2023-11-29 01:20:32,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:20:32,985 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2023-11-29 01:20:32,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:20:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2023-11-29 01:20:32,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 01:20:32,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:20:32,987 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:20:32,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 01:20:33,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:33,200 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:20:33,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:33,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1010083921, now seen corresponding path program 1 times [2023-11-29 01:20:33,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:20:33,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857823532] [2023-11-29 01:20:33,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:33,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:33,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:20:33,204 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:20:33,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 01:20:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:33,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 01:20:33,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:33,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:20:33,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:20:33,568 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-29 01:20:33,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:33,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:20:33,641 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:20:33,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:20:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-29 01:20:33,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:38,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:20:38,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857823532] [2023-11-29 01:20:38,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857823532] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:20:38,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [170153470] [2023-11-29 01:20:38,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:38,351 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:20:38,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:20:38,354 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:20:38,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-11-29 01:20:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:38,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 01:20:38,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:38,610 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-29 01:20:38,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:20:38,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:38,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:20:38,836 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:20:38,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:20:38,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-29 01:20:38,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:40,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [170153470] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:20:40,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:20:40,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 01:20:40,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183438118] [2023-11-29 01:20:40,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:20:40,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:20:40,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:20:40,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:20:40,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=69, Unknown=2, NotChecked=16, Total=110 [2023-11-29 01:20:40,855 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:20:42,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:42,169 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2023-11-29 01:20:42,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:20:42,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-29 01:20:42,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:20:42,172 INFO L225 Difference]: With dead ends: 104 [2023-11-29 01:20:42,172 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 01:20:42,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=31, Invalid=103, Unknown=2, NotChecked=20, Total=156 [2023-11-29 01:20:42,173 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 2 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:20:42,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 301 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 423 Invalid, 0 Unknown, 111 Unchecked, 1.1s Time] [2023-11-29 01:20:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 01:20:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2023-11-29 01:20:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 97 states have internal predecessors, (105), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 01:20:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2023-11-29 01:20:42,182 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 19 [2023-11-29 01:20:42,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:20:42,183 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2023-11-29 01:20:42,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:20:42,183 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2023-11-29 01:20:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 01:20:42,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:20:42,185 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:20:42,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 01:20:42,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2023-11-29 01:20:42,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:20:42,589 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:20:42,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:42,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1861334165, now seen corresponding path program 1 times [2023-11-29 01:20:42,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:20:42,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600258472] [2023-11-29 01:20:42,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:42,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:42,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:20:42,592 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:20:42,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 01:20:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:42,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 01:20:42,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:42,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:20:42,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-29 01:20:42,924 WARN L876 $PredicateComparison]: unable to prove that (and (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 01:20:43,032 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 01:20:43,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 01:20:43,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-29 01:20:43,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:43,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-11-29 01:20:43,420 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)))) is different from true [2023-11-29 01:20:43,468 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 01:20:43,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 01:20:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2023-11-29 01:20:43,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:43,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:20:43,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600258472] [2023-11-29 01:20:43,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600258472] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:20:43,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1155300693] [2023-11-29 01:20:43,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:43,892 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:20:43,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:20:43,893 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:20:43,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-11-29 01:20:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:44,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 01:20:44,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:44,207 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 01:20:44,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 01:20:44,254 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 01:20:44,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 01:20:44,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:44,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:44,350 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-11-29 01:20:44,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 29 [2023-11-29 01:20:44,477 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 01:20:44,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2023-11-29 01:20:44,528 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2023-11-29 01:20:44,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:44,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:44,633 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-11-29 01:20:44,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2023-11-29 01:20:44,880 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 01:20:44,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2023-11-29 01:20:44,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:44,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:45,005 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-11-29 01:20:45,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2023-11-29 01:20:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2023-11-29 01:20:45,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:45,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1155300693] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:20:45,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:20:45,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 01:20:45,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714243996] [2023-11-29 01:20:45,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:20:45,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 01:20:45,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:20:45,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 01:20:45,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=252, Unknown=3, NotChecked=102, Total=420 [2023-11-29 01:20:45,293 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 01:20:47,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:47,274 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2023-11-29 01:20:47,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:20:47,275 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2023-11-29 01:20:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:20:47,276 INFO L225 Difference]: With dead ends: 111 [2023-11-29 01:20:47,276 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 01:20:47,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=340, Unknown=3, NotChecked=120, Total=552 [2023-11-29 01:20:47,277 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 372 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:20:47,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 230 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 321 Invalid, 0 Unknown, 330 Unchecked, 1.8s Time] [2023-11-29 01:20:47,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 01:20:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 94. [2023-11-29 01:20:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 53 states have (on average 1.8113207547169812) internal successors, (96), 88 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 01:20:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2023-11-29 01:20:47,282 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 27 [2023-11-29 01:20:47,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:20:47,282 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2023-11-29 01:20:47,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 01:20:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2023-11-29 01:20:47,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 01:20:47,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:20:47,284 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:20:47,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2023-11-29 01:20:47,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 01:20:47,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:47,686 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:20:47,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:47,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1861334164, now seen corresponding path program 1 times [2023-11-29 01:20:47,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:20:47,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362914470] [2023-11-29 01:20:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:47,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:47,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:20:47,692 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:20:47,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 01:20:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:47,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 01:20:47,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:47,942 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-29 01:20:47,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:20:47,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-29 01:20:47,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:20:48,011 WARN L876 $PredicateComparison]: unable to prove that (and (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 01:20:48,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:48,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:20:48,089 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:20:48,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:20:48,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:20:48,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:48,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:20:48,412 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|)) is different from true [2023-11-29 01:20:48,454 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-29 01:20:48,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-11-29 01:20:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2023-11-29 01:20:48,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:48,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:20:48,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362914470] [2023-11-29 01:20:48,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362914470] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:20:48,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [481793812] [2023-11-29 01:20:48,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:48,797 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:20:48,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:20:48,798 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:20:48,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-11-29 01:20:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:49,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 01:20:49,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:49,128 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-29 01:20:49,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:20:49,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:49,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:20:49,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:20:49,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:49,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:20:49,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:20:49,615 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|)))) is different from true [2023-11-29 01:20:49,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:49,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:20:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2023-11-29 01:20:49,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:49,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [481793812] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:20:49,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:20:49,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2023-11-29 01:20:49,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582375798] [2023-11-29 01:20:49,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:20:49,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 01:20:49,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:20:49,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 01:20:49,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=226, Unknown=3, NotChecked=96, Total=380 [2023-11-29 01:20:49,938 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 17 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 01:20:54,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:21:03,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:21:09,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:21:14,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:21:15,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:21:15,154 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2023-11-29 01:21:15,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:21:15,155 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2023-11-29 01:21:15,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:21:15,156 INFO L225 Difference]: With dead ends: 102 [2023-11-29 01:21:15,156 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 01:21:15,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=93, Invalid=377, Unknown=4, NotChecked=126, Total=600 [2023-11-29 01:21:15,157 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 199 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 16 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:21:15,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 162 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 294 Invalid, 4 Unknown, 303 Unchecked, 20.9s Time] [2023-11-29 01:21:15,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 01:21:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2023-11-29 01:21:15,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.6415094339622642) internal successors, (87), 79 states have internal predecessors, (87), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 01:21:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2023-11-29 01:21:15,161 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 27 [2023-11-29 01:21:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:21:15,161 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2023-11-29 01:21:15,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 01:21:15,161 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2023-11-29 01:21:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 01:21:15,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:21:15,162 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 01:21:15,165 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 01:21:15,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2023-11-29 01:21:15,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:21:15,563 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:21:15,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:21:15,563 INFO L85 PathProgramCache]: Analyzing trace with hash 678077439, now seen corresponding path program 2 times [2023-11-29 01:21:15,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:21:15,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500683647] [2023-11-29 01:21:15,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:21:15,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:21:15,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:21:15,565 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:21:15,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 01:21:15,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:21:15,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:21:15,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:21:15,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:21:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 01:21:15,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:21:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 01:21:15,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:21:15,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500683647] [2023-11-29 01:21:15,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500683647] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:21:15,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:21:15,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-11-29 01:21:15,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143311210] [2023-11-29 01:21:15,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:21:15,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:21:15,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:21:15,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:21:15,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:21:15,871 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 01:21:16,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:21:16,136 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2023-11-29 01:21:16,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:21:16,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2023-11-29 01:21:16,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:21:16,138 INFO L225 Difference]: With dead ends: 79 [2023-11-29 01:21:16,138 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 01:21:16,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:21:16,139 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:21:16,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 276 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:21:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 01:21:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-29 01:21:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 74 states have internal predecessors, (80), 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-29 01:21:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2023-11-29 01:21:16,142 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 28 [2023-11-29 01:21:16,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:21:16,142 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2023-11-29 01:21:16,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 01:21:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2023-11-29 01:21:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 01:21:16,143 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:21:16,143 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:21:16,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 01:21:16,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:21:16,343 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:21:16,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:21:16,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1316655134, now seen corresponding path program 1 times [2023-11-29 01:21:16,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:21:16,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815494111] [2023-11-29 01:21:16,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:21:16,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:21:16,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:21:16,345 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:21:16,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 01:21:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:16,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 01:21:16,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:21:16,780 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-29 01:21:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:21:16,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:21:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 01:21:16,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:21:16,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815494111] [2023-11-29 01:21:16,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815494111] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:21:16,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:21:16,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2023-11-29 01:21:16,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897311520] [2023-11-29 01:21:16,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:21:16,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:21:16,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:21:16,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:21:16,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:21:16,927 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 01:21:20,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec, FloatRoundingMode], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:21:24,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:21:29,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:21:33,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:21:37,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:21:37,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:21:37,906 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2023-11-29 01:21:37,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:21:37,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-11-29 01:21:37,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:21:37,908 INFO L225 Difference]: With dead ends: 80 [2023-11-29 01:21:37,908 INFO L226 Difference]: Without dead ends: 80 [2023-11-29 01:21:37,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-11-29 01:21:37,909 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 33 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:21:37,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 462 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 5 Unknown, 0 Unchecked, 20.8s Time] [2023-11-29 01:21:37,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-29 01:21:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-29 01:21:37,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 74 states have internal predecessors, (79), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:21:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2023-11-29 01:21:37,914 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 30 [2023-11-29 01:21:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:21:37,914 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2023-11-29 01:21:37,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 01:21:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2023-11-29 01:21:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 01:21:37,916 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:21:37,916 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:21:37,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 01:21:38,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:21:38,116 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:21:38,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:21:38,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1316668384, now seen corresponding path program 1 times [2023-11-29 01:21:38,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:21:38,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922853708] [2023-11-29 01:21:38,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:21:38,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:21:38,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:21:38,118 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:21:38,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 01:21:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:38,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 01:21:38,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:21:38,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:21:38,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 01:21:38,541 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)))) is different from true [2023-11-29 01:21:38,599 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-29 01:21:38,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2023-11-29 01:21:38,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:21:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-29 01:21:38,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:21:39,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 01:21:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:21:39,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:21:39,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922853708] [2023-11-29 01:21:39,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922853708] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:21:39,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:21:39,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2023-11-29 01:21:39,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392213444] [2023-11-29 01:21:39,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:21:39,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 01:21:39,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:21:39,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:21:39,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=91, Unknown=1, NotChecked=18, Total=132 [2023-11-29 01:21:39,363 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 01:21:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:21:40,889 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2023-11-29 01:21:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:21:40,890 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-11-29 01:21:40,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:21:40,891 INFO L225 Difference]: With dead ends: 80 [2023-11-29 01:21:40,891 INFO L226 Difference]: Without dead ends: 80 [2023-11-29 01:21:40,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2023-11-29 01:21:40,892 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 28 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:21:40,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 359 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 382 Invalid, 0 Unknown, 77 Unchecked, 1.4s Time] [2023-11-29 01:21:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-29 01:21:40,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2023-11-29 01:21:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 73 states have internal predecessors, (79), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:21:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2023-11-29 01:21:40,895 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 30 [2023-11-29 01:21:40,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:21:40,895 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2023-11-29 01:21:40,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 01:21:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2023-11-29 01:21:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 01:21:40,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:21:40,896 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:21:40,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 01:21:41,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:21:41,097 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:21:41,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:21:41,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1316668385, now seen corresponding path program 1 times [2023-11-29 01:21:41,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:21:41,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034846618] [2023-11-29 01:21:41,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:21:41,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:21:41,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:21:41,099 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:21:41,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 01:21:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:41,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 01:21:41,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:21:41,293 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-29 01:21:41,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:21:41,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:21:41,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 01:21:41,784 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 01:21:41,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:21:41,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-29 01:21:41,892 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 01:21:41,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-11-29 01:21:42,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 17 treesize of output 9 [2023-11-29 01:21:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-29 01:21:42,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:21:42,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:21:42,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034846618] [2023-11-29 01:21:42,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034846618] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:21:42,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1626433832] [2023-11-29 01:21:42,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:21:42,703 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:21:42,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:21:42,704 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:21:42,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-11-29 01:21:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:43,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 01:21:43,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:21:43,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:21:43,105 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-29 01:21:43,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:21:43,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 01:21:43,783 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_11| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 01:21:43,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:21:43,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-29 01:21:43,872 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 01:21:43,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-11-29 01:21:44,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 01:21:44,090 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-29 01:21:44,090 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:21:44,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1626433832] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:21:44,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:21:44,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2023-11-29 01:21:44,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643968309] [2023-11-29 01:21:44,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:21:44,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 01:21:44,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:21:44,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 01:21:44,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=364, Unknown=2, NotChecked=78, Total=506 [2023-11-29 01:21:44,505 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 20 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 01:21:47,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:21:47,174 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2023-11-29 01:21:47,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 01:21:47,175 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-11-29 01:21:47,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:21:47,177 INFO L225 Difference]: With dead ends: 88 [2023-11-29 01:21:47,177 INFO L226 Difference]: Without dead ends: 88 [2023-11-29 01:21:47,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=106, Invalid=656, Unknown=2, NotChecked=106, Total=870 [2023-11-29 01:21:47,178 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 126 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:21:47,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 356 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 486 Invalid, 0 Unknown, 180 Unchecked, 1.9s Time] [2023-11-29 01:21:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-29 01:21:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2023-11-29 01:21:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 80 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:21:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-11-29 01:21:47,184 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 30 [2023-11-29 01:21:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:21:47,184 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-11-29 01:21:47,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 01:21:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-11-29 01:21:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 01:21:47,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:21:47,185 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:21:47,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2023-11-29 01:21:47,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 01:21:47,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:21:47,586 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:21:47,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:21:47,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1237458696, now seen corresponding path program 1 times [2023-11-29 01:21:47,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:21:47,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624358920] [2023-11-29 01:21:47,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:21:47,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:21:47,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:21:47,588 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:21:47,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 01:21:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:47,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:21:47,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:21:47,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:21:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 01:21:47,862 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:21:47,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:21:47,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624358920] [2023-11-29 01:21:47,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624358920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:21:47,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:21:47,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:21:47,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608027777] [2023-11-29 01:21:47,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:21:47,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:21:47,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:21:47,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:21:47,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:21:47,865 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 01:21:48,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:21:48,509 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2023-11-29 01:21:48,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:21:48,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2023-11-29 01:21:48,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:21:48,511 INFO L225 Difference]: With dead ends: 85 [2023-11-29 01:21:48,511 INFO L226 Difference]: Without dead ends: 85 [2023-11-29 01:21:48,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:21:48,512 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 11 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:21:48,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 203 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:21:48,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-29 01:21:48,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-29 01:21:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 79 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:21:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-11-29 01:21:48,515 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 34 [2023-11-29 01:21:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:21:48,515 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-11-29 01:21:48,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 01:21:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-11-29 01:21:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 01:21:48,516 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:21:48,517 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:21:48,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 01:21:48,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:21:48,717 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:21:48,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:21:48,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1237458697, now seen corresponding path program 1 times [2023-11-29 01:21:48,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:21:48,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504618209] [2023-11-29 01:21:48,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:21:48,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:21:48,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:21:48,719 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:21:48,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 01:21:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:48,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 01:21:48,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:21:48,887 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-29 01:21:49,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 01:21:49,110 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:21:49,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:21:49,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504618209] [2023-11-29 01:21:49,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504618209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:21:49,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:21:49,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:21:49,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017046247] [2023-11-29 01:21:49,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:21:49,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:21:49,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:21:49,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:21:49,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:21:49,113 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 01:21:49,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:21:49,727 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2023-11-29 01:21:49,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:21:49,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2023-11-29 01:21:49,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:21:49,728 INFO L225 Difference]: With dead ends: 84 [2023-11-29 01:21:49,728 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 01:21:49,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:21:49,729 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 10 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:21:49,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 219 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:21:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 01:21:49,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-29 01:21:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.423728813559322) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:21:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-11-29 01:21:49,733 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 34 [2023-11-29 01:21:49,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:21:49,733 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-11-29 01:21:49,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 01:21:49,733 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-11-29 01:21:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 01:21:49,734 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:21:49,734 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:21:49,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 01:21:49,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:21:49,935 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:21:49,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:21:49,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1237464813, now seen corresponding path program 1 times [2023-11-29 01:21:49,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:21:49,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427512677] [2023-11-29 01:21:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:21:49,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:21:49,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:21:49,936 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:21:49,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 01:21:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:50,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 01:21:50,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:21:50,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:21:50,494 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:21:50,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:21:50,669 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-29 01:21:50,842 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-29 01:21:50,842 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 72 treesize of output 59 [2023-11-29 01:21:50,951 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 40 treesize of output 16 [2023-11-29 01:21:50,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:21:51,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:21:51,294 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 48 treesize of output 37 [2023-11-29 01:21:51,399 INFO L349 Elim1Store]: treesize reduction 92, result has 37.4 percent of original size [2023-11-29 01:21:51,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 75 [2023-11-29 01:21:51,705 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 82 treesize of output 54 [2023-11-29 01:21:51,717 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 47 treesize of output 31 [2023-11-29 01:21:51,996 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 35 treesize of output 19 [2023-11-29 01:21:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:21:52,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:21:53,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:21:53,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427512677] [2023-11-29 01:21:53,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427512677] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:21:53,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [576260158] [2023-11-29 01:21:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:21:53,700 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:21:53,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:21:53,701 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-11-29 01:21:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:54,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-29 01:21:54,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:21:54,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:21:54,721 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:21:54,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:21:55,081 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-29 01:21:55,381 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 01:21:55,381 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 56 treesize of output 43 [2023-11-29 01:21:55,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-11-29 01:21:55,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:22:08,135 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (_ bv0 32)) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 01:22:08,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:22:08,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2023-11-29 01:22:08,292 INFO L349 Elim1Store]: treesize reduction 84, result has 35.9 percent of original size [2023-11-29 01:22:08,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 60 [2023-11-29 01:22:08,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2023-11-29 01:22:12,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 01:22:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 01:22:13,091 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:22:13,252 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_86| (_ BitVec 32)) (v_ArrVal_1022 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_86|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_node_create_~temp~0#1.base_86| v_ArrVal_1022) (select (select (store |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_86| v_ArrVal_1023) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (_ bv1 1))))) is different from false [2023-11-29 01:22:13,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [576260158] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:22:13,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:22:13,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2023-11-29 01:22:13,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551881792] [2023-11-29 01:22:13,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:22:13,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-29 01:22:13,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:22:13,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 01:22:13,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1268, Unknown=18, NotChecked=146, Total=1560 [2023-11-29 01:22:13,258 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 35 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 28 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:22:17,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:22:21,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:22:33,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:22:37,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:22:41,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:22:49,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:23:18,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:23:24,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:23:25,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:23:25,289 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2023-11-29 01:23:25,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 01:23:25,290 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 28 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-11-29 01:23:25,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:23:25,291 INFO L225 Difference]: With dead ends: 86 [2023-11-29 01:23:25,291 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 01:23:25,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 57.7s TimeCoverageRelationStatistics Valid=245, Invalid=2088, Unknown=27, NotChecked=190, Total=2550 [2023-11-29 01:23:25,294 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 140 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 6 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 34.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:23:25,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 631 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 859 Invalid, 8 Unknown, 89 Unchecked, 34.8s Time] [2023-11-29 01:23:25,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 01:23:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2023-11-29 01:23:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 79 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:23:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-11-29 01:23:25,298 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 34 [2023-11-29 01:23:25,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:23:25,299 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-11-29 01:23:25,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 28 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:23:25,299 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-11-29 01:23:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 01:23:25,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:23:25,300 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:23:25,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2023-11-29 01:23:25,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-11-29 01:23:25,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:23:25,701 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 01:23:25,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:23:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1237464814, now seen corresponding path program 1 times [2023-11-29 01:23:25,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:23:25,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284785261] [2023-11-29 01:23:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:23:25,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:23:25,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:23:25,703 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:23:25,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 01:23:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:23:25,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 01:23:25,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:23:25,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:23:25,949 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-29 01:23:26,409 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:23:26,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:23:26,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:23:26,674 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-29 01:23:26,705 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-29 01:23:26,905 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-29 01:23:26,905 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 121 treesize of output 90 [2023-11-29 01:23:26,928 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 48 treesize of output 19 [2023-11-29 01:23:27,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 21 [2023-11-29 01:23:27,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2023-11-29 01:23:27,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:23:27,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:23:27,488 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#1.offset|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-29 01:23:27,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:23:27,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 48 [2023-11-29 01:23:27,603 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-11-29 01:23:27,603 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 36 treesize of output 38 [2023-11-29 01:23:27,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-29 01:23:27,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-29 01:23:27,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 56 [2023-11-29 01:23:27,998 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 56 treesize of output 36 [2023-11-29 01:23:28,342 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 33 treesize of output 17 [2023-11-29 01:23:28,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:23:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 01:23:28,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:23:33,441 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (forall ((|v_node_create_~temp~0#1.base_89| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_89|))) (forall ((v_ArrVal_1102 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_89| v_ArrVal_1102) .cse1) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))))) (forall ((|v_node_create_~temp~0#1.base_89| (_ BitVec 32))) (or (forall ((v_ArrVal_1102 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1103 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_89| v_ArrVal_1102) .cse1) .cse2)) (select (store |c_#length| |v_node_create_~temp~0#1.base_89| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_89| v_ArrVal_1103) .cse1) .cse2)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_89|))))))) is different from false [2023-11-29 01:23:33,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:23:33,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284785261] [2023-11-29 01:23:33,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284785261] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:23:33,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1358155443] [2023-11-29 01:23:33,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:23:33,449 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:23:33,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:23:33,450 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:23:33,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e4ba1d1-7563-497b-9f18-222c01bb5d98/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-11-29 01:23:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:23:33,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 01:23:33,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:23:33,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:23:33,935 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-29 01:23:34,792 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:23:34,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:23:34,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:23:35,250 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-29 01:23:35,264 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-29 01:23:35,589 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 01:23:35,589 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 93 treesize of output 62 [2023-11-29 01:23:35,611 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-29 01:23:35,871 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 45 treesize of output 21 [2023-11-29 01:23:35,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 01:23:35,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:23:35,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3