./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/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_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:25:30,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:25:30,776 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:25:30,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:25:30,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:25:30,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:25:30,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:25:30,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:25:30,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:25:30,804 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:25:30,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:25:30,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:25:30,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:25:30,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:25:30,807 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:25:30,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:25:30,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:25:30,809 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:25:30,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:25:30,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:25:30,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:25:30,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:25:30,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:25:30,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:25:30,812 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:25:30,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:25:30,813 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:25:30,813 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:25:30,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:25:30,814 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:25:30,814 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:25:30,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:25:30,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:25:30,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:25:30,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:25:30,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:25:30,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:25:30,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:25:30,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:25:30,816 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:25:30,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:25:30,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:25:30,817 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_300b06dd-43ab-487b-bbb0-908741caff50/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_300b06dd-43ab-487b-bbb0-908741caff50/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2023-11-29 04:25:31,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:25:31,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:25:31,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:25:31,062 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:25:31,063 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:25:31,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2023-11-29 04:25:33,826 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:25:34,046 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:25:34,047 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2023-11-29 04:25:34,062 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/data/32e0ae288/62bd4df11a364a9abe8fccbb485ca00c/FLAGb973193b9 [2023-11-29 04:25:34,073 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/data/32e0ae288/62bd4df11a364a9abe8fccbb485ca00c [2023-11-29 04:25:34,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:25:34,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:25:34,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:25:34,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:25:34,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:25:34,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:25:34" (1/1) ... [2023-11-29 04:25:34,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50acc7fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:34, skipping insertion in model container [2023-11-29 04:25:34,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:25:34" (1/1) ... [2023-11-29 04:25:34,124 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:25:34,377 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2023-11-29 04:25:34,381 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:25:34,391 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:25:34,430 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2023-11-29 04:25:34,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:25:34,457 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:25:34,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:34 WrapperNode [2023-11-29 04:25:34,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:25:34,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:25:34,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:25:34,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:25:34,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:34" (1/1) ... [2023-11-29 04:25:34,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:34" (1/1) ... [2023-11-29 04:25:34,503 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 161 [2023-11-29 04:25:34,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:25:34,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:25:34,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:25:34,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:25:34,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:34" (1/1) ... [2023-11-29 04:25:34,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:34" (1/1) ... [2023-11-29 04:25:34,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:34" (1/1) ... [2023-11-29 04:25:34,542 INFO L175 MemorySlicer]: Split 28 memory accesses to 3 slices as follows [2, 16, 10]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 7, 1]. [2023-11-29 04:25:34,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:34" (1/1) ... [2023-11-29 04:25:34,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:34" (1/1) ... [2023-11-29 04:25:34,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:34" (1/1) ... [2023-11-29 04:25:34,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:34" (1/1) ... [2023-11-29 04:25:34,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:34" (1/1) ... [2023-11-29 04:25:34,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:34" (1/1) ... [2023-11-29 04:25:34,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:25:34,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:25:34,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:25:34,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:25:34,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:34" (1/1) ... [2023-11-29 04:25:34,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:25:34,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:25:34,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:25:34,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:25:34,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:25:34,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:25:34,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:25:34,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:25:34,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:25:34,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:25:34,633 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 04:25:34,633 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 04:25:34,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:25:34,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:25:34,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:25:34,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:25:34,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:25:34,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 04:25:34,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:25:34,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:25:34,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 04:25:34,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:25:34,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 04:25:34,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 04:25:34,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 04:25:34,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:25:34,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:25:34,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:25:34,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:25:34,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:25:34,756 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:25:34,758 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:25:34,947 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:25:34,991 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:25:34,991 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 04:25:34,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:25:34 BoogieIcfgContainer [2023-11-29 04:25:34,992 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:25:34,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:25:34,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:25:34,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:25:34,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:25:34" (1/3) ... [2023-11-29 04:25:34,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435ad9cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:25:34, skipping insertion in model container [2023-11-29 04:25:34,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:34" (2/3) ... [2023-11-29 04:25:34,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435ad9cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:25:34, skipping insertion in model container [2023-11-29 04:25:34,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:25:34" (3/3) ... [2023-11-29 04:25:35,000 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2023-11-29 04:25:35,016 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:25:35,016 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:25:35,059 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:25:35,065 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@296db8b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:25:35,066 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:25:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 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 04:25:35,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 04:25:35,076 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:25:35,077 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:35,077 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:25:35,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:35,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2101823815, now seen corresponding path program 1 times [2023-11-29 04:25:35,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:35,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497928720] [2023-11-29 04:25:35,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:35,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:35,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:25:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:35,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:25:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:25:35,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:35,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497928720] [2023-11-29 04:25:35,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497928720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:35,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:35,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:25:35,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304128408] [2023-11-29 04:25:35,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:35,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:25:35,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:35,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:25:35,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:25:35,405 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 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, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:25:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:25:35,481 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2023-11-29 04:25:35,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:25:35,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-29 04:25:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:25:35,491 INFO L225 Difference]: With dead ends: 62 [2023-11-29 04:25:35,491 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 04:25:35,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:25:35,497 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:25:35,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:25:35,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 04:25:35,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-29 04:25:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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 04:25:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-11-29 04:25:35,535 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 19 [2023-11-29 04:25:35,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:25:35,537 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-11-29 04:25:35,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:25:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2023-11-29 04:25:35,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 04:25:35,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:25:35,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:35,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:25:35,540 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:25:35,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:35,541 INFO L85 PathProgramCache]: Analyzing trace with hash -536293836, now seen corresponding path program 1 times [2023-11-29 04:25:35,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:35,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997016596] [2023-11-29 04:25:35,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:35,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:35,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:25:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:35,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:25:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:25:35,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997016596] [2023-11-29 04:25:35,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997016596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:35,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:35,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:25:35,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089340726] [2023-11-29 04:25:35,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:35,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:25:35,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:35,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:25:35,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:25:35,729 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:25:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:25:35,782 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2023-11-29 04:25:35,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:25:35,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-11-29 04:25:35,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:25:35,784 INFO L225 Difference]: With dead ends: 49 [2023-11-29 04:25:35,784 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 04:25:35,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 04:25:35,786 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:25:35,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 71 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:25:35,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 04:25:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-29 04:25:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:25:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-11-29 04:25:35,794 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 20 [2023-11-29 04:25:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:25:35,794 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-11-29 04:25:35,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:25:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2023-11-29 04:25:35,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 04:25:35,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:25:35,796 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:35,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:25:35,797 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:25:35,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:35,797 INFO L85 PathProgramCache]: Analyzing trace with hash 538316138, now seen corresponding path program 1 times [2023-11-29 04:25:35,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:35,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085085277] [2023-11-29 04:25:35,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:35,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:36,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:25:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:36,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:25:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:36,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:25:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 04:25:36,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:36,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085085277] [2023-11-29 04:25:36,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085085277] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:25:36,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804931805] [2023-11-29 04:25:36,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:36,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:25:36,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:25:36,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:25:36,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:25:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:36,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 04:25:36,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:25:36,640 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 04:25:36,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:25:36,658 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:25:36,735 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 04:25:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 04:25:36,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804931805] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:25:36,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:25:36,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2023-11-29 04:25:36,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076879216] [2023-11-29 04:25:36,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:25:36,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 04:25:36,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:36,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 04:25:36,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:25:36,770 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 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 04:25:40,782 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 04:25:44,795 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 04:25:48,810 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 04:25:52,848 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 04:25:57,087 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 04:25:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:25:57,089 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2023-11-29 04:25:57,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 04:25:57,090 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 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 26 [2023-11-29 04:25:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:25:57,090 INFO L225 Difference]: With dead ends: 44 [2023-11-29 04:25:57,090 INFO L226 Difference]: Without dead ends: 33 [2023-11-29 04:25:57,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2023-11-29 04:25:57,092 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 50 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:25:57,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 237 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2023-11-29 04:25:57,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-29 04:25:57,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-11-29 04:25:57,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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 04:25:57,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-29 04:25:57,101 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 26 [2023-11-29 04:25:57,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:25:57,101 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-29 04:25:57,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 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 04:25:57,102 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-11-29 04:25:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 04:25:57,103 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:25:57,103 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:57,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:25:57,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:25:57,304 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:25:57,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:57,305 INFO L85 PathProgramCache]: Analyzing trace with hash -62087795, now seen corresponding path program 1 times [2023-11-29 04:25:57,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:57,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509720469] [2023-11-29 04:25:57,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:57,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:58,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:25:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:58,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:25:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:58,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:25:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:58,196 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:25:58,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:58,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509720469] [2023-11-29 04:25:58,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509720469] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:25:58,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643512038] [2023-11-29 04:25:58,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:58,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:25:58,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:25:58,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:25:58,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:25:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:58,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-29 04:25:58,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:25:58,388 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 04:25:58,562 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:25:58,562 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 04:25:58,618 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 04:25:58,695 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 04:25:58,695 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 04:25:58,762 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 04:25:58,781 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 04:25:58,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:58,969 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 04:25:58,986 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 04:25:58,986 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 04:25:59,476 INFO L349 Elim1Store]: treesize reduction 65, result has 14.5 percent of original size [2023-11-29 04:25:59,476 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 68 treesize of output 50 [2023-11-29 04:25:59,503 INFO L349 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2023-11-29 04:25:59,504 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 77 treesize of output 69 [2023-11-29 04:25:59,528 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 34 treesize of output 28 [2023-11-29 04:26:19,653 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 04:26:19,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 04:26:19,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:26:19,776 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 102 treesize of output 90 [2023-11-29 04:26:19,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:26:19,791 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 51 treesize of output 39 [2023-11-29 04:26:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:19,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:26:19,830 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array Int Int))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_464) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0)))) is different from false [2023-11-29 04:26:20,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643512038] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:26:20,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:26:20,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 34 [2023-11-29 04:26:20,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335100916] [2023-11-29 04:26:20,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:26:20,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 04:26:20,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:20,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 04:26:20,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1360, Unknown=9, NotChecked=74, Total=1560 [2023-11-29 04:26:20,289 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 26 states have internal predecessors, (40), 4 states have call successors, (6), 4 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 04:26:24,472 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 04:26:28,685 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 04:26:36,752 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 04:26:44,826 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 04:26:48,908 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 04:26:57,013 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 04:27:01,035 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 04:27:05,077 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 04:27:05,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:27:05,449 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2023-11-29 04:27:05,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 04:27:05,449 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 26 states have internal predecessors, (40), 4 states have call successors, (6), 4 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 29 [2023-11-29 04:27:05,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:27:05,451 INFO L225 Difference]: With dead ends: 75 [2023-11-29 04:27:05,451 INFO L226 Difference]: Without dead ends: 63 [2023-11-29 04:27:05,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=255, Invalid=2707, Unknown=12, NotChecked=106, Total=3080 [2023-11-29 04:27:05,454 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 7 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:27:05,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 409 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 550 Invalid, 8 Unknown, 0 Unchecked, 32.6s Time] [2023-11-29 04:27:05,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-29 04:27:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2023-11-29 04:27:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 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 04:27:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2023-11-29 04:27:05,467 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 29 [2023-11-29 04:27:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:27:05,468 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2023-11-29 04:27:05,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 26 states have internal predecessors, (40), 4 states have call successors, (6), 4 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 04:27:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2023-11-29 04:27:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 04:27:05,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:05,469 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 04:27:05,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 04:27:05,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:27:05,670 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:27:05,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:05,671 INFO L85 PathProgramCache]: Analyzing trace with hash 776284163, now seen corresponding path program 1 times [2023-11-29 04:27:05,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:27:05,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173359136] [2023-11-29 04:27:05,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:05,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:27:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:07,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:27:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:27:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:07,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:27:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:27:08,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:27:08,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173359136] [2023-11-29 04:27:08,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173359136] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:27:08,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678668565] [2023-11-29 04:27:08,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:08,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:27:08,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:27:08,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:27:08,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 04:27:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:08,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 145 conjunts are in the unsatisfiable core [2023-11-29 04:27:08,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:08,532 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 04:27:08,746 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 04:27:08,815 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:27:08,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 04:27:08,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 04:27:08,907 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 04:27:09,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 04:27:09,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 04:27:09,174 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 04:27:09,179 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 04:27:09,183 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 04:27:09,436 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 04:27:09,436 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 20 treesize of output 22 [2023-11-29 04:27:09,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 04:27:09,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 04:27:09,919 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 04:27:10,095 INFO L349 Elim1Store]: treesize reduction 20, result has 60.0 percent of original size [2023-11-29 04:27:10,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2023-11-29 04:27:10,109 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-29 04:27:10,110 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 04:27:10,120 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 04:27:10,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2023-11-29 04:27:10,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 12 treesize of output 1 [2023-11-29 04:27:10,152 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 11 [2023-11-29 04:27:10,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 04:27:10,174 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 0 case distinctions, treesize of input 30 treesize of output 23 [2023-11-29 04:27:10,303 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 37 treesize of output 21 [2023-11-29 04:27:10,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:27:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:27:10,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:27:10,811 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_643) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_642) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_643 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_643 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) is different from false [2023-11-29 04:27:10,837 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_643) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_642) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_643 (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_643 .cse1)))))))) is different from false [2023-11-29 04:27:10,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2023-11-29 04:27:10,852 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_51 Int) (v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_51 v_ArrVal_643) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_642) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_643 (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (store (select |c_#memory_int#1| v_arrayElimCell_51) .cse0 (select v_ArrVal_643 .cse0))))))) is different from false [2023-11-29 04:27:10,864 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_51 Int) (v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_51 v_ArrVal_643) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_642) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (store (select |c_#memory_int#1| v_arrayElimCell_51) .cse0 (select v_ArrVal_643 .cse0))) v_ArrVal_643)))) is different from false [2023-11-29 04:27:10,878 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_51 Int) (v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_51 v_ArrVal_643) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_642) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (store (select |c_#memory_int#1| v_arrayElimCell_51) .cse0 (select v_ArrVal_643 .cse0))) v_ArrVal_643)))) is different from false [2023-11-29 04:27:11,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678668565] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:27:11,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:27:11,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 46 [2023-11-29 04:27:11,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787915797] [2023-11-29 04:27:11,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:27:11,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-29 04:27:11,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:27:11,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-29 04:27:11,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2320, Unknown=5, NotChecked=500, Total=2970 [2023-11-29 04:27:11,108 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 46 states, 38 states have (on average 1.368421052631579) internal successors, (52), 37 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 04:27:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:27:15,253 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2023-11-29 04:27:15,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-29 04:27:15,253 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 38 states have (on average 1.368421052631579) internal successors, (52), 37 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 33 [2023-11-29 04:27:15,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:27:15,255 INFO L225 Difference]: With dead ends: 105 [2023-11-29 04:27:15,255 INFO L226 Difference]: Without dead ends: 97 [2023-11-29 04:27:15,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=532, Invalid=7139, Unknown=5, NotChecked=880, Total=8556 [2023-11-29 04:27:15,259 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 127 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:27:15,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 549 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 04:27:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-29 04:27:15,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 69. [2023-11-29 04:27:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 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 04:27:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2023-11-29 04:27:15,275 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 33 [2023-11-29 04:27:15,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:27:15,276 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2023-11-29 04:27:15,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 38 states have (on average 1.368421052631579) internal successors, (52), 37 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 04:27:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2023-11-29 04:27:15,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 04:27:15,277 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:15,277 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 04:27:15,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 04:27:15,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:27:15,478 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:27:15,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:15,479 INFO L85 PathProgramCache]: Analyzing trace with hash -926488386, now seen corresponding path program 2 times [2023-11-29 04:27:15,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:27:15,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117088231] [2023-11-29 04:27:15,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:15,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:27:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:16,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:27:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:16,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:27:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:16,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:27:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 04:27:17,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:27:17,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117088231] [2023-11-29 04:27:17,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117088231] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:27:17,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594786019] [2023-11-29 04:27:17,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:27:17,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:27:17,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:27:17,160 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:27:17,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 04:27:17,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:27:17,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:27:17,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 04:27:17,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:17,431 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 04:27:17,584 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2023-11-29 04:27:17,586 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2023-11-29 04:27:17,602 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 04:27:17,615 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 04:27:17,620 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from false [2023-11-29 04:27:17,623 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from true [2023-11-29 04:27:17,687 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-29 04:27:17,687 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 42 [2023-11-29 04:27:17,712 INFO L349 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2023-11-29 04:27:17,712 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 39 treesize of output 30 [2023-11-29 04:27:17,741 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)))) is different from false [2023-11-29 04:27:17,744 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)))) is different from true [2023-11-29 04:27:17,765 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 04:27:17,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2023-11-29 04:27:17,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:27:17,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 04:27:17,791 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-11-29 04:27:17,793 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-11-29 04:27:17,820 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-11-29 04:27:17,822 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-11-29 04:27:17,852 WARN L854 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from false [2023-11-29 04:27:17,855 WARN L876 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from true [2023-11-29 04:27:17,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:27:17,910 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 04:27:17,910 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 56 treesize of output 45 [2023-11-29 04:27:17,952 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2023-11-29 04:27:17,952 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 35 treesize of output 73 [2023-11-29 04:27:18,022 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse0)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0))) (or (= .cse3 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-29 04:27:18,026 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse0)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0))) (or (= .cse3 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-29 04:27:18,130 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0)))) is different from false [2023-11-29 04:27:18,134 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0)))) is different from true [2023-11-29 04:27:18,228 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0)))) is different from false [2023-11-29 04:27:18,232 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0)))) is different from true [2023-11-29 04:27:18,374 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6))))) is different from false [2023-11-29 04:27:18,378 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6))))) is different from true [2023-11-29 04:27:18,482 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:27:18,483 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:27:18,484 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:27:18,491 INFO L349 Elim1Store]: treesize reduction 58, result has 4.9 percent of original size [2023-11-29 04:27:18,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 35 [2023-11-29 04:27:18,539 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) is different from false [2023-11-29 04:27:18,543 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) is different from true [2023-11-29 04:27:18,598 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2023-11-29 04:27:18,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 25 [2023-11-29 04:27:18,624 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse3))) is different from false [2023-11-29 04:27:18,628 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse3))) is different from true [2023-11-29 04:27:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 12 not checked. [2023-11-29 04:27:18,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:27:18,831 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_825 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| Int) (v_ArrVal_826 (Array Int Int))) (or (not (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_826)) (.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_825)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (select (select .cse3 .cse4) .cse5))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse4))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|) 0)))) is different from false [2023-11-29 04:27:18,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594786019] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:27:18,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:27:18,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 34 [2023-11-29 04:27:18,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101422940] [2023-11-29 04:27:18,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:27:18,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 04:27:18,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:27:18,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 04:27:18,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=641, Unknown=25, NotChecked=806, Total=1560 [2023-11-29 04:27:18,836 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 34 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 26 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:27:18,986 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2023-11-29 04:27:18,988 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2023-11-29 04:27:18,992 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from false [2023-11-29 04:27:18,994 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from true [2023-11-29 04:27:18,999 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 0) .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select |c_#valid| .cse4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)))) is different from false [2023-11-29 04:27:19,002 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 0) .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select |c_#valid| .cse4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)))) is different from true [2023-11-29 04:27:19,007 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from false [2023-11-29 04:27:19,010 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from true [2023-11-29 04:27:19,013 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-11-29 04:27:19,016 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-11-29 04:27:19,028 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from false [2023-11-29 04:27:19,033 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from true [2023-11-29 04:27:19,052 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse8) 0)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse10) .cse2))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| (select .cse1 .cse2)) .cse3) .cse4) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse5)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse7 (select |v_#valid_BEFORE_CALL_11| .cse7)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse6) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse8 (select (select |c_#memory_$Pointer$#1.base| .cse5) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse9 (select |v_old(#valid)_AFTER_CALL_12| .cse9))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse8) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.base| (select .cse1 .cse4)) .cse3) .cse10) (or (= .cse8 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-11-29 04:27:19,056 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse8) 0)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse10) .cse2))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| (select .cse1 .cse2)) .cse3) .cse4) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse5)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse7 (select |v_#valid_BEFORE_CALL_11| .cse7)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse6) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse8 (select (select |c_#memory_$Pointer$#1.base| .cse5) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse9 (select |v_old(#valid)_AFTER_CALL_12| .cse9))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse8) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.base| (select .cse1 .cse4)) .cse3) .cse10) (or (= .cse8 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-11-29 04:27:19,070 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse10) .cse2)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| .cse7) 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| (select .cse1 .cse2)) .cse3) .cse4) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse5) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse7 (select (select |c_#memory_$Pointer$#1.base| .cse8) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse8) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse9 (select |v_old(#valid)_AFTER_CALL_12| .cse9))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| (select .cse1 .cse4)) .cse3) .cse10) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 0) 0))))) is different from false [2023-11-29 04:27:19,074 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse10) .cse2)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| .cse7) 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| (select .cse1 .cse2)) .cse3) .cse4) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse5) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse7 (select (select |c_#memory_$Pointer$#1.base| .cse8) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse8) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse9 (select |v_old(#valid)_AFTER_CALL_12| .cse9))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| (select .cse1 .cse4)) .cse3) .cse10) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 0) 0))))) is different from true [2023-11-29 04:27:19,092 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse5) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse0 0)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4) (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse6) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse8 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 0) 0)))) is different from false [2023-11-29 04:27:19,096 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse5) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse0 0)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4) (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse6) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse8 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 0) 0)))) is different from true [2023-11-29 04:27:19,109 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (.cse6 (select .cse2 0)) (.cse7 (select .cse8 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_old(#valid)_AFTER_CALL_12| .cse5))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7))))) is different from false [2023-11-29 04:27:19,114 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (.cse6 (select .cse2 0)) (.cse7 (select .cse8 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_old(#valid)_AFTER_CALL_12| .cse5))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7))))) is different from true [2023-11-29 04:27:19,129 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6))))) is different from false [2023-11-29 04:27:19,134 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6))))) is different from true [2023-11-29 04:27:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:27:19,240 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2023-11-29 04:27:19,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 04:27:19,241 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 26 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2023-11-29 04:27:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:27:19,242 INFO L225 Difference]: With dead ends: 79 [2023-11-29 04:27:19,242 INFO L226 Difference]: Without dead ends: 63 [2023-11-29 04:27:19,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=123, Invalid=738, Unknown=47, NotChecked=1848, Total=2756 [2023-11-29 04:27:19,244 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 877 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:27:19,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 331 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 193 Invalid, 0 Unknown, 877 Unchecked, 0.2s Time] [2023-11-29 04:27:19,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-29 04:27:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-29 04:27:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 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 04:27:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2023-11-29 04:27:19,256 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 35 [2023-11-29 04:27:19,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:27:19,256 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2023-11-29 04:27:19,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 26 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:27:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2023-11-29 04:27:19,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 04:27:19,258 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:19,258 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 04:27:19,263 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 04:27:19,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 04:27:19,458 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:27:19,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1531607570, now seen corresponding path program 1 times [2023-11-29 04:27:19,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:27:19,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574014765] [2023-11-29 04:27:19,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:19,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:27:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:19,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:27:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:19,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:27:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:19,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:27:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 04:27:19,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:27:19,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574014765] [2023-11-29 04:27:19,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574014765] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:27:19,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018376491] [2023-11-29 04:27:19,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:19,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:27:19,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:27:19,900 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:27:19,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 04:27:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:20,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 04:27:20,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:20,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 70 [2023-11-29 04:27:20,641 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2023-11-29 04:27:20,641 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 73 [2023-11-29 04:27:20,648 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-29 04:27:20,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 40 [2023-11-29 04:27:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:27:20,657 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:27:20,938 INFO L349 Elim1Store]: treesize reduction 31, result has 65.9 percent of original size [2023-11-29 04:27:20,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 135 [2023-11-29 04:27:20,967 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-11-29 04:27:20,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 83 [2023-11-29 04:27:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 04:27:21,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018376491] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:27:21,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:27:21,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 10] total 25 [2023-11-29 04:27:21,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698894677] [2023-11-29 04:27:21,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:27:21,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 04:27:21,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:27:21,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 04:27:21,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2023-11-29 04:27:21,030 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 25 states, 24 states have (on average 2.25) internal successors, (54), 23 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:27:22,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:27:22,180 INFO L93 Difference]: Finished difference Result 156 states and 184 transitions. [2023-11-29 04:27:22,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-29 04:27:22,181 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 23 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-11-29 04:27:22,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:27:22,182 INFO L225 Difference]: With dead ends: 156 [2023-11-29 04:27:22,182 INFO L226 Difference]: Without dead ends: 148 [2023-11-29 04:27:22,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=312, Invalid=1850, Unknown=0, NotChecked=0, Total=2162 [2023-11-29 04:27:22,184 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 210 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:27:22,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 375 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:27:22,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-29 04:27:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 104. [2023-11-29 04:27:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 95 states have (on average 1.263157894736842) internal successors, (120), 95 states have internal predecessors, (120), 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 04:27:22,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2023-11-29 04:27:22,206 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 38 [2023-11-29 04:27:22,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:27:22,206 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2023-11-29 04:27:22,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 23 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:27:22,206 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2023-11-29 04:27:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 04:27:22,208 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:22,208 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 04:27:22,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 04:27:22,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:27:22,413 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:27:22,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:22,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1531652272, now seen corresponding path program 1 times [2023-11-29 04:27:22,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:27:22,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276709637] [2023-11-29 04:27:22,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:22,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:27:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:25,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:27:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:25,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:27:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:25,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:27:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:27:25,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:27:25,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276709637] [2023-11-29 04:27:25,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276709637] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:27:25,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13090999] [2023-11-29 04:27:25,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:25,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:27:25,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:27:25,964 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:27:25,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 04:27:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:26,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 156 conjunts are in the unsatisfiable core [2023-11-29 04:27:26,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:26,230 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 04:27:26,239 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 04:27:26,552 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 04:27:26,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 04:27:26,575 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:27:26,575 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 04:27:26,687 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 04:27:26,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:27:26,708 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 04:27:26,850 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 04:27:26,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 83 [2023-11-29 04:27:26,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:27:26,860 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 55 treesize of output 19 [2023-11-29 04:27:26,869 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 04:27:26,958 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 04:27:26,963 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 04:27:26,968 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 04:27:26,972 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 04:27:27,257 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 04:27:27,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-29 04:27:27,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:27:27,274 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 53 treesize of output 36 [2023-11-29 04:27:27,294 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-11-29 04:27:27,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 1 case distinctions, treesize of input 24 treesize of output 31 [2023-11-29 04:27:27,318 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 04:27:27,319 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 04:27:28,127 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2023-11-29 04:27:28,128 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 89 [2023-11-29 04:27:28,149 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-11-29 04:27:28,149 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 252 treesize of output 133 [2023-11-29 04:27:28,159 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 65 treesize of output 15 [2023-11-29 04:27:28,166 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 107 treesize of output 34 [2023-11-29 04:27:28,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:27:28,172 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 34 treesize of output 19 [2023-11-29 04:27:28,327 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 101 treesize of output 61 [2023-11-29 04:27:28,853 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 04:27:28,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2023-11-29 04:27:28,860 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 04:27:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 04:27:28,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:27:29,170 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1169) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1167) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1168) .cse0) .cse1)) (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1166) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1171) .cse0) .cse1))))) (not (= v_ArrVal_1169 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_1169 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) is different from false [2023-11-29 04:27:29,208 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1169) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1167) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1168) .cse1) .cse2)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1166) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1171) .cse1) .cse2) 4)))) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|) (not (= v_ArrVal_1169 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| (select v_ArrVal_1169 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|))))))) is different from false [2023-11-29 04:27:29,242 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4))) (or (= (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1169) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1167) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1168) .cse1) .cse2)) (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1166) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1171) .cse1) .cse2)))) |c_ULTIMATE.start_main_~data~0#1|) (< (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|) (not (= v_ArrVal_1169 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| (select v_ArrVal_1169 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|)))))))) is different from false [2023-11-29 04:27:29,265 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1))) (or (< (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| .cse2 v_ArrVal_1169) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1167) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse2 (store (select |c_#memory_$Pointer$#1.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1168) .cse3) .cse4)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1166) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1171) .cse3) .cse4) 4)))) (not (= v_ArrVal_1169 (store (select |c_#memory_int#1| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| (select v_ArrVal_1169 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|)))))))) is different from false [2023-11-29 04:27:29,356 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1180 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1179 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_1180)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select .cse3 .cse1) .cse2))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30|) 0)) (not (= (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_1181) .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| (select v_ArrVal_1169 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|)) v_ArrVal_1169)) (< (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_1179) .cse1) .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31|) (= |c_ULTIMATE.start_main_~data~0#1| (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|))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1169) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_1167) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 (store (select .cse3 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_1168) .cse4) .cse5)) (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1166) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_1171) .cse4) .cse5))))))))) is different from false [2023-11-29 04:27:29,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13090999] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:27:29,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:27:29,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 51 [2023-11-29 04:27:29,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717539130] [2023-11-29 04:27:29,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:27:29,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-29 04:27:29,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:27:29,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-29 04:27:29,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2703, Unknown=5, NotChecked=540, Total=3422 [2023-11-29 04:27:29,361 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 51 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 41 states have internal predecessors, (61), 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 04:27:33,950 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 04:27:38,332 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 04:27:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:27:44,131 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2023-11-29 04:27:44,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 04:27:44,132 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 41 states have internal predecessors, (61), 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 38 [2023-11-29 04:27:44,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:27:44,134 INFO L225 Difference]: With dead ends: 145 [2023-11-29 04:27:44,134 INFO L226 Difference]: Without dead ends: 143 [2023-11-29 04:27:44,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=344, Invalid=4926, Unknown=6, NotChecked=730, Total=6006 [2023-11-29 04:27:44,137 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 63 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:27:44,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 567 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1270 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2023-11-29 04:27:44,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-29 04:27:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2023-11-29 04:27:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 114 states have (on average 1.2719298245614035) internal successors, (145), 114 states have internal predecessors, (145), 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 04:27:44,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 155 transitions. [2023-11-29 04:27:44,174 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 155 transitions. Word has length 38 [2023-11-29 04:27:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:27:44,175 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 155 transitions. [2023-11-29 04:27:44,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 41 states have internal predecessors, (61), 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 04:27:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 155 transitions. [2023-11-29 04:27:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 04:27:44,177 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:44,177 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 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 04:27:44,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 04:27:44,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:27:44,379 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:27:44,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1417957325, now seen corresponding path program 1 times [2023-11-29 04:27:44,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:27:44,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650363314] [2023-11-29 04:27:44,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:44,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:27:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:44,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:27:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:44,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:27:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:44,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:27:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:44,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:27:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 04:27:44,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:27:44,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650363314] [2023-11-29 04:27:44,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650363314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:27:44,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:27:44,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:27:44,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544076838] [2023-11-29 04:27:44,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:27:44,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:27:44,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:27:44,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:27:44,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:27:44,493 INFO L87 Difference]: Start difference. First operand 123 states and 155 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 04:27:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:27:44,549 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2023-11-29 04:27:44,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:27:44,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 39 [2023-11-29 04:27:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:27:44,551 INFO L225 Difference]: With dead ends: 139 [2023-11-29 04:27:44,551 INFO L226 Difference]: Without dead ends: 59 [2023-11-29 04:27:44,551 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 04:27:44,552 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:27:44,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 68 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:27:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-29 04:27:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-29 04:27:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 states have internal predecessors, (62), 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 04:27:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2023-11-29 04:27:44,570 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 39 [2023-11-29 04:27:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:27:44,571 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2023-11-29 04:27:44,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 04:27:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2023-11-29 04:27:44,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 04:27:44,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:44,572 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:27:44,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:27:44,572 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:27:44,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:44,572 INFO L85 PathProgramCache]: Analyzing trace with hash -278927968, now seen corresponding path program 1 times [2023-11-29 04:27:44,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:27:44,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008900923] [2023-11-29 04:27:44,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:44,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:27:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:47,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:27:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:47,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:27:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:47,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:27:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 04:27:47,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:27:47,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008900923] [2023-11-29 04:27:47,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008900923] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:27:47,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217100610] [2023-11-29 04:27:47,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:47,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:27:47,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:27:47,981 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:27:47,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300b06dd-43ab-487b-bbb0-908741caff50/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 04:27:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:48,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 171 conjunts are in the unsatisfiable core [2023-11-29 04:27:48,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:48,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:27:48,516 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:27:48,517 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 04:27:48,601 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 04:27:48,606 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 04:27:48,720 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-29 04:27:48,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 50 [2023-11-29 04:27:48,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2023-11-29 04:27:48,838 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 04:27:48,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2023-11-29 04:27:48,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 04:27:48,847 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 04:27:49,016 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 04:27:49,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:27:49,160 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 04:27:49,160 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 72 treesize of output 55 [2023-11-29 04:27:49,182 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 04:27:49,182 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 04:27:49,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-11-29 04:27:49,974 INFO L349 Elim1Store]: treesize reduction 52, result has 56.3 percent of original size [2023-11-29 04:27:49,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 118 [2023-11-29 04:27:50,018 INFO L349 Elim1Store]: treesize reduction 82, result has 22.6 percent of original size [2023-11-29 04:27:50,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 147 treesize of output 144 [2023-11-29 04:27:50,051 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-11-29 04:27:50,051 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2023-11-29 04:27:50,080 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2023-11-29 04:27:50,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 41 [2023-11-29 04:27:50,118 INFO L349 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2023-11-29 04:27:50,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 97 [2023-11-29 04:27:50,133 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 22 treesize of output 28 [2023-11-29 04:27:50,151 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 04:27:50,172 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:27:50,172 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 16 treesize of output 1 [2023-11-29 04:27:50,199 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 43 treesize of output 18 [2023-11-29 04:27:50,259 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 46 treesize of output 36 [2023-11-29 04:27:50,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 04:27:51,366 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 04:27:51,367 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 04:27:51,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:27:51,847 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 206 treesize of output 170 [2023-11-29 04:27:52,775 INFO L349 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2023-11-29 04:27:52,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 116 [2023-11-29 04:27:52,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:27:52,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 61 [2023-11-29 04:27:53,043 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 04:27:53,043 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 22 treesize of output 14 [2023-11-29 04:27:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:27:53,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:27:54,495 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (and (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1487))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_ArrVal_1486 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) v_ArrVal_1486)) (forall ((v_ArrVal_1485 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (let ((.cse9 (store .cse11 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1485)) (.cse4 (store .cse10 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1483))) (let ((.cse6 (select (select .cse4 .cse5) .cse8)) (.cse7 (select (select .cse9 .cse5) .cse8))) (let ((.cse2 (select (select .cse4 .cse6) .cse7)) (.cse1 (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1486)) (.cse3 (select (select .cse9 .cse6) .cse7))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse1 .cse2) (+ .cse3 4))) (not (= (select (select .cse4 .cse2) .cse3) .cse5)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse1 .cse6) (+ .cse7 4))) (= .cse8 .cse3))))))))) (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1487))) (or (not (= (store (select .cse12 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_ArrVal_1486 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) v_ArrVal_1486)) (forall ((v_ArrVal_1485 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (let ((.cse19 (store .cse11 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1485)) (.cse16 (store .cse10 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1483))) (let ((.cse17 (select (select .cse16 .cse5) .cse8)) (.cse18 (select (select .cse19 .cse5) .cse8))) (let ((.cse15 (select (select .cse19 .cse17) .cse18)) (.cse13 (store .cse12 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1486)) (.cse14 (select (select .cse16 .cse17) .cse18))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 .cse14) (+ .cse15 4))) (not (= (select (select .cse16 .cse14) .cse15) .cse5)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 .cse17) (+ .cse18 4))) (= .cse14 .cse5))))))))))) is different from false [2023-11-29 04:28:00,072 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (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 ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (or (not (= (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select .cse0 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1487))) (or (not (= v_ArrVal_1486 (store (select .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| (select v_ArrVal_1486 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)))) (forall ((v_ArrVal_1485 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1485)) (.cse9 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1483))) (let ((.cse5 (select (select .cse9 .cse8) .cse3)) (.cse6 (select (select .cse10 .cse8) .cse3))) (let ((.cse4 (store .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1486)) (.cse7 (select (select .cse9 .cse5) .cse6)) (.cse2 (select (select .cse10 .cse5) .cse6))) (or (= .cse2 .cse3) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse4 .cse5) (+ .cse6 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse4 .cse7) (+ .cse2 4))) (not (= .cse8 (select (select .cse9 .cse7) .cse2)))))))))))))) (forall ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (or (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1487))) (or (not (= v_ArrVal_1486 (store (select .cse11 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| (select v_ArrVal_1486 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)))) (forall ((v_ArrVal_1485 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1485)) (.cse17 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store .cse19 |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1483))) (let ((.cse13 (select (select .cse17 .cse8) .cse3)) (.cse14 (select (select .cse18 .cse8) .cse3))) (let ((.cse12 (store .cse11 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1486)) (.cse15 (select (select .cse17 .cse13) .cse14)) (.cse16 (select (select .cse18 .cse13) .cse14))) (or (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 .cse13) (+ .cse14 4))) (= .cse15 .cse8) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 .cse15) (+ .cse16 4))) (not (= .cse8 (select (select .cse17 .cse15) .cse16))))))))))) (not (= (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select .cse19 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))))) is different from false [2023-11-29 04:28:01,083 INFO L349 Elim1Store]: treesize reduction 836, result has 71.3 percent of original size [2023-11-29 04:28:01,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 4299 treesize of output 5746 [2023-11-29 04:28:01,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:28:01,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3392 treesize of output 4034 [2023-11-29 04:28:01,588 INFO L349 Elim1Store]: treesize reduction 224, result has 59.9 percent of original size [2023-11-29 04:28:01,589 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2531 treesize of output 2757 [2023-11-29 04:28:01,837 INFO L349 Elim1Store]: treesize reduction 224, result has 59.9 percent of original size [2023-11-29 04:28:01,837 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2422 treesize of output 2648 [2023-11-29 04:28:05,069 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 78 treesize of output 4 [2023-11-29 04:28:10,693 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 78 treesize of output 4 [2023-11-29 04:28:10,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:28:10,786 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 301 treesize of output 301 [2023-11-29 04:28:10,915 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 78 treesize of output 4 [2023-11-29 04:28:11,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 4