./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:13:51,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:13:51,993 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:13:51,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:13:51,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:13:52,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:13:52,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:13:52,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:13:52,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:13:52,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:13:52,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:13:52,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:13:52,040 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:13:52,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:13:52,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:13:52,042 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:13:52,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:13:52,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:13:52,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:13:52,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:13:52,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:13:52,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:13:52,046 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:13:52,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:13:52,047 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:13:52,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:13:52,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:13:52,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:13:52,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:13:52,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:13:52,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:13:52,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:13:52,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:13:52,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:13:52,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:13:52,060 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:13:52,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:13:52,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:13:52,061 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:13:52,061 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_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/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_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2023-11-06 22:13:52,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:13:52,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:13:52,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:13:52,406 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:13:52,406 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:13:52,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-11-06 22:13:55,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:13:55,724 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:13:55,725 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-11-06 22:13:55,743 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/data/3a31bc6e4/5926548e29fe44bb945110036c8267a9/FLAG4184b5e8a [2023-11-06 22:13:55,758 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/data/3a31bc6e4/5926548e29fe44bb945110036c8267a9 [2023-11-06 22:13:55,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:13:55,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:13:55,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:13:55,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:13:55,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:13:55,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:13:55" (1/1) ... [2023-11-06 22:13:55,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c2affc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:55, skipping insertion in model container [2023-11-06 22:13:55,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:13:55" (1/1) ... [2023-11-06 22:13:55,824 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:13:56,160 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_2545bb2e-f640-4187-81d1-3006216af479/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2023-11-06 22:13:56,170 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:13:56,180 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:13:56,261 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_2545bb2e-f640-4187-81d1-3006216af479/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2023-11-06 22:13:56,265 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:13:56,300 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:13:56,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:56 WrapperNode [2023-11-06 22:13:56,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:13:56,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:13:56,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:13:56,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:13:56,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:56" (1/1) ... [2023-11-06 22:13:56,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:56" (1/1) ... [2023-11-06 22:13:56,426 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2023-11-06 22:13:56,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:13:56,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:13:56,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:13:56,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:13:56,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:56" (1/1) ... [2023-11-06 22:13:56,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:56" (1/1) ... [2023-11-06 22:13:56,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:56" (1/1) ... [2023-11-06 22:13:56,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:56" (1/1) ... [2023-11-06 22:13:56,468 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:56" (1/1) ... [2023-11-06 22:13:56,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:56" (1/1) ... [2023-11-06 22:13:56,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:56" (1/1) ... [2023-11-06 22:13:56,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:56" (1/1) ... [2023-11-06 22:13:56,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:13:56,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:13:56,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:13:56,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:13:56,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:56" (1/1) ... [2023-11-06 22:13:56,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:13:56,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:56,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:13:56,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:13:56,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:13:56,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:13:56,557 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 22:13:56,557 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 22:13:56,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:13:56,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:13:56,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:13:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:13:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:13:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:13:56,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:13:56,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:13:56,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:13:56,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:13:56,688 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:13:56,690 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:13:57,003 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:13:57,016 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:13:57,017 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 22:13:57,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:13:57 BoogieIcfgContainer [2023-11-06 22:13:57,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:13:57,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:13:57,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:13:57,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:13:57,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:13:55" (1/3) ... [2023-11-06 22:13:57,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9931007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:13:57, skipping insertion in model container [2023-11-06 22:13:57,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:56" (2/3) ... [2023-11-06 22:13:57,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9931007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:13:57, skipping insertion in model container [2023-11-06 22:13:57,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:13:57" (3/3) ... [2023-11-06 22:13:57,033 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2023-11-06 22:13:57,056 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:13:57,056 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:13:57,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:13:57,121 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=LoopsAndPotentialCycles, 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;@2b323674, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:13:57,121 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:13:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 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-06 22:13:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-06 22:13:57,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:57,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:57,136 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:57,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:57,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1454169709, now seen corresponding path program 1 times [2023-11-06 22:13:57,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:57,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219934666] [2023-11-06 22:13:57,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:57,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:57,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:57,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:13:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:13:57,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:57,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219934666] [2023-11-06 22:13:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219934666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:57,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:57,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:13:57,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051564873] [2023-11-06 22:13:57,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:57,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:13:57,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:57,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:13:57,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:13:57,638 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 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 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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-06 22:13:57,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:57,724 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2023-11-06 22:13:57,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:13:57,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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 23 [2023-11-06 22:13:57,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:57,734 INFO L225 Difference]: With dead ends: 67 [2023-11-06 22:13:57,735 INFO L226 Difference]: Without dead ends: 29 [2023-11-06 22:13:57,738 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-06 22:13:57,741 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 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-06 22:13:57,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:13:57,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-06 22:13:57,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-06 22:13:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 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-06 22:13:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-11-06 22:13:57,782 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2023-11-06 22:13:57,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:57,785 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-11-06 22:13:57,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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-06 22:13:57,786 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-11-06 22:13:57,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-06 22:13:57,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:57,788 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:57,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:13:57,789 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:57,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:57,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1579182041, now seen corresponding path program 1 times [2023-11-06 22:13:57,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:57,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923671583] [2023-11-06 22:13:57,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:57,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:58,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:13:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:13:58,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:58,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923671583] [2023-11-06 22:13:58,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923671583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:58,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:58,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:13:58,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166276246] [2023-11-06 22:13:58,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:58,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:13:58,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:58,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:13:58,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:13:58,143 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-06 22:13:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:58,235 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2023-11-06 22:13:58,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:13:58,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 23 [2023-11-06 22:13:58,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:58,237 INFO L225 Difference]: With dead ends: 54 [2023-11-06 22:13:58,237 INFO L226 Difference]: Without dead ends: 32 [2023-11-06 22:13:58,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-06 22:13:58,245 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:58,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:13:58,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-06 22:13:58,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-11-06 22:13:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-06 22:13:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-11-06 22:13:58,261 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 23 [2023-11-06 22:13:58,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:58,262 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-11-06 22:13:58,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-06 22:13:58,263 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-11-06 22:13:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 22:13:58,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:58,266 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:58,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:13:58,266 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:58,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:58,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1665445247, now seen corresponding path program 1 times [2023-11-06 22:13:58,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120478702] [2023-11-06 22:13:58,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:58,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:58,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:58,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:13:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:59,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:13:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:13:59,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:59,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120478702] [2023-11-06 22:13:59,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120478702] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:59,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630166363] [2023-11-06 22:13:59,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:59,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:59,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:59,188 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:13:59,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:13:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:59,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-06 22:13:59,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:13:59,720 INFO L351 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-06 22:13:59,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:59,838 INFO L351 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 17 treesize of output 12 [2023-11-06 22:13:59,888 INFO L351 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-06 22:13:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:13:59,913 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:14:00,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630166363] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:00,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:14:00,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-11-06 22:14:00,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68810832] [2023-11-06 22:14:00,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:14:00,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 22:14:00,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:00,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 22:14:00,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=523, Unknown=2, NotChecked=0, Total=600 [2023-11-06 22:14:00,072 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 23 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:14:00,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:00,795 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2023-11-06 22:14:00,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:14:00,798 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2023-11-06 22:14:00,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:00,799 INFO L225 Difference]: With dead ends: 41 [2023-11-06 22:14:00,799 INFO L226 Difference]: Without dead ends: 32 [2023-11-06 22:14:00,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=849, Unknown=2, NotChecked=0, Total=992 [2023-11-06 22:14:00,801 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 73 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:00,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 221 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:14:00,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-06 22:14:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-11-06 22:14:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:14:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-11-06 22:14:00,817 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 31 [2023-11-06 22:14:00,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:00,818 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-11-06 22:14:00,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:14:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-11-06 22:14:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 22:14:00,821 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:00,821 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:00,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:14:01,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:01,027 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:01,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:01,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1631242898, now seen corresponding path program 1 times [2023-11-06 22:14:01,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:01,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292567806] [2023-11-06 22:14:01,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:01,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:14:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:14:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:14:02,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:02,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292567806] [2023-11-06 22:14:02,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292567806] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:02,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054898963] [2023-11-06 22:14:02,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:02,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:02,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:02,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:14:02,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:14:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 85 conjunts are in the unsatisfiable core [2023-11-06 22:14:02,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:03,008 INFO L351 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-06 22:14:03,335 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:14:03,335 INFO L351 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-06 22:14:03,459 INFO L351 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-06 22:14:03,602 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:14:03,603 INFO L351 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 34 treesize of output 33 [2023-11-06 22:14:03,785 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:14:03,786 INFO L351 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 39 treesize of output 22 [2023-11-06 22:14:03,800 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:14:03,808 INFO L351 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-06 22:14:03,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,979 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:14:03,980 INFO L351 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 47 treesize of output 38 [2023-11-06 22:14:04,003 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:14:04,003 INFO L351 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-06 22:14:04,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:04,020 INFO L351 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 16 treesize of output 11 [2023-11-06 22:14:04,151 INFO L351 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-06 22:14:04,216 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:14:04,216 INFO L351 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 35 treesize of output 18 [2023-11-06 22:14:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:04,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:14:04,465 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_14| Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (or (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_14| v_ArrVal_484))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_14| v_ArrVal_485) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_14| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_14|) 0)))) is different from false [2023-11-06 22:14:04,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054898963] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:04,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:14:04,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 36 [2023-11-06 22:14:04,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741598211] [2023-11-06 22:14:04,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:14:04,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-06 22:14:04,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:04,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-06 22:14:04,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1284, Unknown=1, NotChecked=72, Total=1482 [2023-11-06 22:14:04,472 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 36 states, 32 states have (on average 1.46875) internal successors, (47), 27 states have internal predecessors, (47), 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-06 22:14:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:06,361 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2023-11-06 22:14:06,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:14:06,364 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 1.46875) internal successors, (47), 27 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-11-06 22:14:06,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:06,365 INFO L225 Difference]: With dead ends: 57 [2023-11-06 22:14:06,366 INFO L226 Difference]: Without dead ends: 47 [2023-11-06 22:14:06,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=314, Invalid=2551, Unknown=1, NotChecked=104, Total=2970 [2023-11-06 22:14:06,371 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 121 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:06,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 352 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:14:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-06 22:14:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2023-11-06 22:14:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:14:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-11-06 22:14:06,393 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 34 [2023-11-06 22:14:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:06,393 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-11-06 22:14:06,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 1.46875) internal successors, (47), 27 states have internal predecessors, (47), 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-06 22:14:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-11-06 22:14:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 22:14:06,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:06,401 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-06 22:14:06,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:14:06,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:06,607 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:06,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1471122359, now seen corresponding path program 1 times [2023-11-06 22:14:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:06,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557921981] [2023-11-06 22:14:06,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:06,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:14:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:14:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:14:09,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:09,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557921981] [2023-11-06 22:14:09,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557921981] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:09,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687019088] [2023-11-06 22:14:09,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:09,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:09,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:09,113 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:14:09,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:14:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:09,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-06 22:14:09,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:09,332 INFO L351 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-06 22:14:09,391 INFO L351 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-06 22:14:09,510 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-11-06 22:14:09,513 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-11-06 22:14:09,545 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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-06 22:14:09,548 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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-06 22:14:09,604 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))) is different from false [2023-11-06 22:14:09,607 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))) is different from true [2023-11-06 22:14:09,639 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2023-11-06 22:14:09,642 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2023-11-06 22:14:09,699 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))) is different from false [2023-11-06 22:14:09,702 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))) is different from true [2023-11-06 22:14:09,818 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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-06 22:14:09,823 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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-06 22:14:09,857 INFO L351 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-06 22:14:09,897 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-11-06 22:14:09,901 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-11-06 22:14:10,006 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:14:10,006 INFO L351 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 35 treesize of output 34 [2023-11-06 22:14:10,052 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1)))) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-11-06 22:14:10,057 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1)))) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-11-06 22:14:10,147 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse0 1)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-11-06 22:14:10,151 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse0 1)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-11-06 22:14:10,194 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-06 22:14:10,195 INFO L351 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 44 treesize of output 19 [2023-11-06 22:14:10,238 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-06 22:14:10,242 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-06 22:14:10,326 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-06 22:14:10,331 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-06 22:14:10,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 22:14:10,506 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-06 22:14:10,510 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-06 22:14:10,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:10,697 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:14:10,698 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 55 [2023-11-06 22:14:10,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:10,711 INFO L351 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 43 treesize of output 36 [2023-11-06 22:14:10,825 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1))))))) is different from false [2023-11-06 22:14:10,831 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1))))))) is different from true [2023-11-06 22:14:11,017 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-06 22:14:11,023 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-06 22:14:11,197 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)))) is different from false [2023-11-06 22:14:11,202 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)))) is different from true [2023-11-06 22:14:11,510 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-06 22:14:11,516 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-06 22:14:11,875 INFO L322 Elim1Store]: treesize reduction 124, result has 0.8 percent of original size [2023-11-06 22:14:11,876 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 440 treesize of output 315 [2023-11-06 22:14:11,906 INFO L322 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2023-11-06 22:14:11,906 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 275 treesize of output 234 [2023-11-06 22:14:11,941 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:11,947 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:14:11,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:11,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:11,991 INFO L322 Elim1Store]: treesize reduction 130, result has 0.8 percent of original size [2023-11-06 22:14:11,991 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 219 treesize of output 151 [2023-11-06 22:14:12,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:12,031 INFO L322 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-11-06 22:14:12,032 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 109 [2023-11-06 22:14:12,069 INFO L351 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 163 treesize of output 43 [2023-11-06 22:14:12,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:12,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:12,192 INFO L322 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2023-11-06 22:14:12,192 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 225 treesize of output 175 [2023-11-06 22:14:12,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:12,247 INFO L322 Elim1Store]: treesize reduction 53, result has 15.9 percent of original size [2023-11-06 22:14:12,248 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 165 treesize of output 181 [2023-11-06 22:14:12,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 143 [2023-11-06 22:14:12,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:12,278 INFO L322 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-11-06 22:14:12,279 INFO L351 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 4 case distinctions, treesize of input 160 treesize of output 118 [2023-11-06 22:14:12,289 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 60 [2023-11-06 22:14:12,301 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2023-11-06 22:14:12,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:12,314 INFO L351 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 39 treesize of output 21 [2023-11-06 22:14:12,521 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse3 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_41 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_41) v_arrayElimCell_44))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_41 1) .cse3) 0) (= 0 (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_41))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| .cse3) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 4)))))) is different from false [2023-11-06 22:14:12,527 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse3 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_41 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_41) v_arrayElimCell_44))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_41 1) .cse3) 0) (= 0 (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_41))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| .cse3) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 4)))))) is different from true [2023-11-06 22:14:12,580 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-06 22:14:12,581 INFO L351 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 92 treesize of output 60 [2023-11-06 22:14:12,607 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2023-11-06 22:14:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2023-11-06 22:14:12,618 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:14:12,677 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_667) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_675) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_674) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_671))) (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_668) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_667 (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_667 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2023-11-06 22:14:12,726 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_667) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_675) .cse0 v_ArrVal_674) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_671))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_668) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not (= v_ArrVal_667 (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_667 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2023-11-06 22:14:12,763 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse2))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_667) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_675) .cse0 v_ArrVal_674) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_671))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_668) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= v_ArrVal_667 (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_667 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2023-11-06 22:14:12,785 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (or (not (= v_ArrVal_667 (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_667 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse2))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_667) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_675) .cse0 v_ArrVal_674) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_671))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) .cse0 v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_668) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) .cse0 v_ArrVal_669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) is different from false [2023-11-06 22:14:12,953 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:12,954 INFO L351 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 1358 treesize of output 1362 [2023-11-06 22:14:13,003 INFO L351 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 1306 treesize of output 1082 [2023-11-06 22:14:13,022 INFO L351 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 1082 treesize of output 970 [2023-11-06 22:14:13,215 INFO L351 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 1321 treesize of output 1209 [2023-11-06 22:14:18,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687019088] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:18,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:14:18,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 41 [2023-11-06 22:14:18,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10055645] [2023-11-06 22:14:18,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:14:18,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-06 22:14:18,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:18,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-06 22:14:18,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=601, Unknown=38, NotChecked=1428, Total=2162 [2023-11-06 22:14:18,128 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 41 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 31 states have internal predecessors, (54), 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-06 22:14:19,481 WARN L839 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-11-06 22:14:19,484 WARN L861 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-11-06 22:14:19,488 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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-06 22:14:19,491 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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-06 22:14:19,496 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_old(#length)| |c_#length|)) is different from false [2023-11-06 22:14:19,499 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_old(#length)| |c_#length|)) is different from true [2023-11-06 22:14:19,504 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from false [2023-11-06 22:14:19,507 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from true [2023-11-06 22:14:19,520 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse1 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |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$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse0 (select |c_#memory_$Pointer$.offset| .cse0))) (or .cse1 (= (select |c_old(#valid)| .cse2) 0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (or (< .cse0 |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (or .cse1 (< .cse2 |c_#StackHeapBarrier|)))) is different from false [2023-11-06 22:14:19,525 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse1 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |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$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse0 (select |c_#memory_$Pointer$.offset| .cse0))) (or .cse1 (= (select |c_old(#valid)| .cse2) 0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (or (< .cse0 |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (or .cse1 (< .cse2 |c_#StackHeapBarrier|)))) is different from true [2023-11-06 22:14:19,539 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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-06 22:14:19,544 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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-06 22:14:19,555 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-11-06 22:14:19,559 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-11-06 22:14:19,578 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-06 22:14:19,583 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-06 22:14:19,606 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse8) (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse6 (+ |c_#StackHeapBarrier| 1))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (select .cse5 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) (select .cse4 0)))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse1) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse1 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| .cse8) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-11-06 22:14:19,611 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse8) (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse6 (+ |c_#StackHeapBarrier| 1))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (select .cse5 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) (select .cse4 0)))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse1) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse1 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| .cse8) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-11-06 22:14:19,624 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_old(#length)| |c_#length|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-06 22:14:19,629 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_old(#length)| |c_#length|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-06 22:14:19,648 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-06 22:14:19,653 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-06 22:14:19,703 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_#res#1.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse2 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse3 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse4 (+ |c_#StackHeapBarrier| 1))) (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select .cse0 (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (or .cse2 (= (select |c_old(#valid)| .cse3) 0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse3 (select |c_#memory_$Pointer$.base| .cse3))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (= (select .cse0 4) |c_node_create_#in~data#1|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (or (< .cse1 |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (or .cse2 (< .cse3 |c_#StackHeapBarrier|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse4 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-06 22:14:19,710 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_#res#1.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse2 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse3 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse4 (+ |c_#StackHeapBarrier| 1))) (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select .cse0 (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (or .cse2 (= (select |c_old(#valid)| .cse3) 0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse3 (select |c_#memory_$Pointer$.base| .cse3))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (= (select .cse0 4) |c_node_create_#in~data#1|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (or (< .cse1 |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (or .cse2 (< .cse3 |c_#StackHeapBarrier|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse4 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-06 22:14:19,789 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2)) (.cse4 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= (select .cse0 4) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse1 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (not (= .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse5 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse7) 1))))))) is different from false [2023-11-06 22:14:19,795 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2)) (.cse4 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= (select .cse0 4) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse1 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (not (= .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse5 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse7) 1))))))) is different from true [2023-11-06 22:14:19,849 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1))))) (not (= .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (not (= .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)))) is different from false [2023-11-06 22:14:19,854 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1))))) (not (= .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (not (= .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)))) is different from true [2023-11-06 22:14:19,902 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse6) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse4 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1))))) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)))) is different from false [2023-11-06 22:14:19,907 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse6) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse4 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1))))) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)))) is different from true [2023-11-06 22:14:19,957 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1))))) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-06 22:14:19,963 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1))))) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-06 22:14:20,045 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse7 0))) (let ((.cse0 (+ .cse4 2)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_41 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_41) v_arrayElimCell_44))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_41 1) .cse4) 0) (= 0 (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_41))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= (select (select |c_#memory_int| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| .cse4) (+ (select .cse1 0) 4))))))) is different from false [2023-11-06 22:14:20,051 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse7 0))) (let ((.cse0 (+ .cse4 2)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_41 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_41) v_arrayElimCell_44))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_41 1) .cse4) 0) (= 0 (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_41))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= (select (select |c_#memory_int| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| .cse4) (+ (select .cse1 0) 4))))))) is different from true [2023-11-06 22:14:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:20,386 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2023-11-06 22:14:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:14:20,387 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 31 states have internal predecessors, (54), 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 36 [2023-11-06 22:14:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:20,388 INFO L225 Difference]: With dead ends: 59 [2023-11-06 22:14:20,388 INFO L226 Difference]: Without dead ends: 57 [2023-11-06 22:14:20,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 38 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=141, Invalid=695, Unknown=72, NotChecked=3382, Total=4290 [2023-11-06 22:14:20,392 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1647 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:20,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 380 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 344 Invalid, 0 Unknown, 1647 Unchecked, 0.5s Time] [2023-11-06 22:14:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-06 22:14:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-06 22:14:20,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 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-06 22:14:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2023-11-06 22:14:20,407 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 36 [2023-11-06 22:14:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:20,407 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2023-11-06 22:14:20,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 31 states have internal predecessors, (54), 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-06 22:14:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2023-11-06 22:14:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:14:20,409 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:20,409 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-06 22:14:20,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:14:20,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:20,617 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:20,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash 704367666, now seen corresponding path program 1 times [2023-11-06 22:14:20,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:20,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778906988] [2023-11-06 22:14:20,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:20,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:23,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:24,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:14:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:24,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:14:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:14:24,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:24,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778906988] [2023-11-06 22:14:24,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778906988] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:24,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143861773] [2023-11-06 22:14:24,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:24,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:24,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:24,811 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:14:24,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:14:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:25,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 129 conjunts are in the unsatisfiable core [2023-11-06 22:14:25,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:25,039 INFO L351 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-06 22:14:25,125 INFO L351 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-06 22:14:25,332 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:14:25,332 INFO L351 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-06 22:14:25,578 INFO L351 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 11 treesize of output 7 [2023-11-06 22:14:25,680 INFO L351 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-06 22:14:25,826 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-06 22:14:25,827 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-06 22:14:26,035 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:14:26,062 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-06 22:14:26,280 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:14:26,281 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2023-11-06 22:14:26,293 INFO L351 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 24 treesize of output 11 [2023-11-06 22:14:26,641 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:14:26,641 INFO L351 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 62 treesize of output 33 [2023-11-06 22:14:26,650 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 22:14:26,657 INFO L351 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-06 22:14:26,663 INFO L351 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-06 22:14:27,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:27,027 INFO L351 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-06 22:14:27,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:27,043 INFO L351 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-06 22:14:27,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:27,061 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:14:27,062 INFO L351 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 70 treesize of output 53 [2023-11-06 22:14:27,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:27,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:27,098 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:14:27,098 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-11-06 22:14:28,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:28,087 INFO L351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2023-11-06 22:14:28,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:28,123 INFO L322 Elim1Store]: treesize reduction 59, result has 10.6 percent of original size [2023-11-06 22:14:28,124 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 86 [2023-11-06 22:14:28,169 INFO L322 Elim1Store]: treesize reduction 78, result has 17.0 percent of original size [2023-11-06 22:14:28,170 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 278 treesize of output 153 [2023-11-06 22:14:28,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:28,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:28,183 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 23 [2023-11-06 22:14:28,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:28,211 INFO L322 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2023-11-06 22:14:28,212 INFO L351 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 171 treesize of output 163 [2023-11-06 22:14:28,608 INFO L322 Elim1Store]: treesize reduction 37, result has 9.8 percent of original size [2023-11-06 22:14:28,609 INFO L351 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 155 treesize of output 53 [2023-11-06 22:14:28,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:28,619 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:14:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:14:28,790 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:14:29,087 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_870)) (.cse0 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_871))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_868) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_875) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_869) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) is different from false [2023-11-06 22:14:29,146 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (let ((.cse4 (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse0 v_ArrVal_870)) (.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_871))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_868) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_875) .cse0 v_ArrVal_869) (select (select .cse1 .cse2) .cse3)) (+ 4 (select (select .cse4 .cse2) .cse3)))))))) is different from false [2023-11-06 22:14:29,176 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse8))) (let ((.cse4 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse8)))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse0 v_ArrVal_870)) (.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse6)))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_871))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_868) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_875) .cse0 v_ArrVal_869) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))))) is different from false [2023-11-06 22:14:29,196 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse8))) (let ((.cse4 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse8)))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse0 v_ArrVal_870)) (.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse6)))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) .cse0 v_ArrVal_871))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_868) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_875) .cse0 v_ArrVal_869) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))))) is different from false [2023-11-06 22:14:29,334 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_870 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int) (v_ArrVal_871 (Array Int Int)) (v_ArrVal_885 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_884))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_885) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select .cse9 .cse6) .cse8))) (let ((.cse4 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| (store v_ArrVal_885 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse8)))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse0 v_ArrVal_870)) (.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| (store v_ArrVal_884 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse6)))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|))) .cse0 v_ArrVal_871))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_868) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_875) .cse0 v_ArrVal_869) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)))) is different from false [2023-11-06 22:14:29,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143861773] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:29,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:14:29,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2023-11-06 22:14:29,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802191836] [2023-11-06 22:14:29,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:14:29,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-06 22:14:29,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:29,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-06 22:14:29,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2528, Unknown=5, NotChecked=520, Total=3192 [2023-11-06 22:14:29,343 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 49 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:14:33,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:33,893 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2023-11-06 22:14:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 22:14:33,894 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-11-06 22:14:33,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:33,895 INFO L225 Difference]: With dead ends: 73 [2023-11-06 22:14:33,895 INFO L226 Difference]: Without dead ends: 71 [2023-11-06 22:14:33,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=279, Invalid=4292, Unknown=5, NotChecked=680, Total=5256 [2023-11-06 22:14:33,899 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 80 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:33,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 451 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-06 22:14:33,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-06 22:14:33,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2023-11-06 22:14:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 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-06 22:14:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2023-11-06 22:14:33,932 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 38 [2023-11-06 22:14:33,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:33,932 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2023-11-06 22:14:33,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:14:33,933 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2023-11-06 22:14:33,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:14:33,938 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:33,938 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:33,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:14:34,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:34,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:34,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:34,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2080860260, now seen corresponding path program 2 times [2023-11-06 22:14:34,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:34,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756979795] [2023-11-06 22:14:34,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:34,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:14:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:14:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,649 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:14:35,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:35,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756979795] [2023-11-06 22:14:35,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756979795] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:35,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828625415] [2023-11-06 22:14:35,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:14:35,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:35,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:35,653 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:14:35,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:14:35,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:14:35,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:14:35,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 123 conjunts are in the unsatisfiable core [2023-11-06 22:14:35,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:35,962 INFO L351 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-06 22:14:36,313 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:14:36,313 INFO L351 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-06 22:14:36,407 INFO L351 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-06 22:14:36,414 INFO L351 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-06 22:14:36,549 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:14:36,550 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2023-11-06 22:14:36,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-11-06 22:14:36,779 INFO L322 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-11-06 22:14:36,780 INFO L351 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 84 treesize of output 42 [2023-11-06 22:14:36,790 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:14:36,790 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2023-11-06 22:14:36,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:37,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:37,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:37,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:37,008 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-06 22:14:37,008 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2023-11-06 22:14:37,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:37,041 INFO L322 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-11-06 22:14:37,041 INFO L351 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 92 treesize of output 73 [2023-11-06 22:14:37,070 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:14:37,071 INFO L351 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-06 22:14:37,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:37,567 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-06 22:14:37,567 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2023-11-06 22:14:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:37,660 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:14:38,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828625415] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:38,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:14:38,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2023-11-06 22:14:38,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317116810] [2023-11-06 22:14:38,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:14:38,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-06 22:14:38,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:38,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-06 22:14:38,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1829, Unknown=0, NotChecked=0, Total=1980 [2023-11-06 22:14:38,231 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 40 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 32 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:14:40,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:40,015 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2023-11-06 22:14:40,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:14:40,016 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 32 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-11-06 22:14:40,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:40,017 INFO L225 Difference]: With dead ends: 73 [2023-11-06 22:14:40,017 INFO L226 Difference]: Without dead ends: 61 [2023-11-06 22:14:40,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=258, Invalid=2498, Unknown=0, NotChecked=0, Total=2756 [2023-11-06 22:14:40,020 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 52 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:40,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 306 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:14:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-06 22:14:40,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2023-11-06 22:14:40,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 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-06 22:14:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2023-11-06 22:14:40,042 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 38 [2023-11-06 22:14:40,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:40,043 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2023-11-06 22:14:40,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 32 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:14:40,043 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2023-11-06 22:14:40,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:14:40,044 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:40,045 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:40,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:14:40,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:40,248 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:40,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:40,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1392203254, now seen corresponding path program 1 times [2023-11-06 22:14:40,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:40,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558788688] [2023-11-06 22:14:40,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:40,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:42,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:42,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:14:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:42,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:14:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:14:43,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:43,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558788688] [2023-11-06 22:14:43,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558788688] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:43,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531030555] [2023-11-06 22:14:43,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:43,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:43,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:43,308 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:14:43,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:14:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:43,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 101 conjunts are in the unsatisfiable core [2023-11-06 22:14:43,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:43,543 INFO L351 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-06 22:14:43,558 INFO L351 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-06 22:14:43,734 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:14:43,734 INFO L351 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-06 22:14:43,921 INFO L351 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 11 treesize of output 7 [2023-11-06 22:14:44,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:44,097 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:14:44,098 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-11-06 22:14:44,229 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:14:44,402 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:14:44,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2023-11-06 22:14:44,702 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-06 22:14:44,702 INFO L351 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 72 treesize of output 27 [2023-11-06 22:14:44,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:44,710 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 22:14:44,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:45,005 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:14:45,006 INFO L351 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 80 treesize of output 63 [2023-11-06 22:14:45,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:45,022 INFO L351 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 62 treesize of output 53 [2023-11-06 22:14:45,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:45,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:45,049 INFO L322 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-06 22:14:45,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2023-11-06 22:14:45,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:45,777 INFO L322 Elim1Store]: treesize reduction 99, result has 10.0 percent of original size [2023-11-06 22:14:45,777 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 98 [2023-11-06 22:14:45,815 INFO L322 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2023-11-06 22:14:45,815 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 239 treesize of output 164 [2023-11-06 22:14:45,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:45,823 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 111 [2023-11-06 22:14:45,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:45,845 INFO L322 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2023-11-06 22:14:45,846 INFO L351 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 214 treesize of output 174 [2023-11-06 22:14:46,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:46,142 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 107 [2023-11-06 22:14:46,513 INFO L322 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-06 22:14:46,514 INFO L351 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 121 treesize of output 39 [2023-11-06 22:14:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:14:46,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:14:46,576 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1257 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1256 (Array Int Int))) (not (let ((.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1256))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1257))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))) is different from false [2023-11-06 22:14:46,610 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1257 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1256 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (let ((.cse1 (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse5 v_ArrVal_1256))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse5 v_ArrVal_1257))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2)))))))))) is different from false [2023-11-06 22:14:46,634 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1257 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1256 (Array Int Int))) (not (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse8) .cse5))) (let ((.cse0 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse8)))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse6 v_ArrVal_1256))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse5)))) (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse6 v_ArrVal_1257))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))))) is different from false [2023-11-06 22:14:46,650 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1257 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1256 (Array Int Int))) (not (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse8) .cse5))) (let ((.cse0 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse8)))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) .cse6 v_ArrVal_1256))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse5)))) (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse6 v_ArrVal_1257))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))))) is different from false [2023-11-06 22:14:46,769 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1257 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1265 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_30| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_30|) 0)) (not (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_30| v_ArrVal_1266))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse5 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_30| v_ArrVal_1265) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse6 (select (select .cse9 .cse8) .cse5))) (let ((.cse1 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_30| (store v_ArrVal_1266 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse8)))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_30|))) .cse6 v_ArrVal_1256))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_30| (store v_ArrVal_1265 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse5)))) (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse6 v_ArrVal_1257))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))))) is different from false [2023-11-06 22:14:46,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531030555] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:46,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:14:46,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 50 [2023-11-06 22:14:46,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423627051] [2023-11-06 22:14:46,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:14:46,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-06 22:14:46,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:46,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-06 22:14:46,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2328, Unknown=6, NotChecked=500, Total=2970 [2023-11-06 22:14:46,776 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 50 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 41 states have internal predecessors, (65), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-06 22:14:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:51,042 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2023-11-06 22:14:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:14:51,042 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 41 states have internal predecessors, (65), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2023-11-06 22:14:51,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:51,043 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:14:51,043 INFO L226 Difference]: Without dead ends: 74 [2023-11-06 22:14:51,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=292, Invalid=4278, Unknown=6, NotChecked=680, Total=5256 [2023-11-06 22:14:51,046 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 125 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 19 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:51,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 436 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1148 Invalid, 2 Unknown, 0 Unchecked, 1.6s Time] [2023-11-06 22:14:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-06 22:14:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2023-11-06 22:14:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 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-06 22:14:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2023-11-06 22:14:51,067 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 41 [2023-11-06 22:14:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:51,067 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2023-11-06 22:14:51,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 41 states have internal predecessors, (65), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-06 22:14:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2023-11-06 22:14:51,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:14:51,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:51,068 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:51,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:14:51,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-06 22:14:51,275 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:51,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:51,275 INFO L85 PathProgramCache]: Analyzing trace with hash -208586744, now seen corresponding path program 1 times [2023-11-06 22:14:51,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:51,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809442118] [2023-11-06 22:14:51,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:51,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:55,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:55,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:14:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:55,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:14:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:55,968 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-06 22:14:55,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:55,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809442118] [2023-11-06 22:14:55,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809442118] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:55,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222927303] [2023-11-06 22:14:55,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:55,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:55,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:55,973 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:14:56,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:14:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:56,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 147 conjunts are in the unsatisfiable core [2023-11-06 22:14:56,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:56,324 INFO L351 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-06 22:14:56,343 INFO L351 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-06 22:14:56,598 INFO L351 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-06 22:14:56,602 INFO L351 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-06 22:14:56,872 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:14:56,873 INFO L351 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-06 22:14:56,898 INFO L351 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-06 22:14:57,052 INFO L351 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-06 22:14:57,065 INFO L351 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-06 22:14:57,093 INFO L351 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-06 22:14:57,287 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:14:57,287 INFO L351 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 97 treesize of output 82 [2023-11-06 22:14:57,300 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 22:14:57,310 INFO L351 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 39 treesize of output 15 [2023-11-06 22:14:57,660 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-06 22:14:57,660 INFO L351 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 107 treesize of output 46 [2023-11-06 22:14:57,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:57,673 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:14:57,679 INFO L351 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 11 treesize of output 7 [2023-11-06 22:14:57,685 INFO L351 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-06 22:14:57,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:58,013 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:14:58,014 INFO L351 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 115 treesize of output 90 [2023-11-06 22:14:58,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:58,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:58,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:58,027 INFO L351 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 97 treesize of output 87 [2023-11-06 22:14:58,054 INFO L322 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-06 22:14:58,055 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-11-06 22:14:58,077 INFO L351 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 28 treesize of output 23 [2023-11-06 22:14:59,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:59,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:59,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:59,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:59,157 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 52 [2023-11-06 22:14:59,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:59,189 INFO L322 Elim1Store]: treesize reduction 99, result has 10.0 percent of original size [2023-11-06 22:14:59,189 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 250 treesize of output 122 [2023-11-06 22:14:59,232 INFO L322 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2023-11-06 22:14:59,232 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 303 treesize of output 202 [2023-11-06 22:14:59,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:59,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:59,257 INFO L351 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 169 [2023-11-06 22:14:59,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:59,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:59,300 INFO L322 Elim1Store]: treesize reduction 126, result has 18.2 percent of original size [2023-11-06 22:14:59,301 INFO L351 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 216 treesize of output 185 [2023-11-06 22:14:59,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:59,318 INFO L351 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 58 treesize of output 31 [2023-11-06 22:15:00,034 INFO L322 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-11-06 22:15:00,035 INFO L351 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 197 treesize of output 62 [2023-11-06 22:15:00,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:00,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:00,257 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2023-11-06 22:15:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:15:00,424 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:15:00,811 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1458))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1457)) (.cse1 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1455))) (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (select (select .cse4 .cse5) .cse6))) (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1461) (select (select .cse1 .cse2) .cse3)) (+ 4 (select (select .cse4 .cse2) .cse3))))))) (not (= v_ArrVal_1461 (store (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select v_ArrVal_1461 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))))))) is different from false [2023-11-06 22:15:00,905 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_29| Int) (v_ArrVal_1461 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1458)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (or (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_29|) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse1 v_ArrVal_1457)) (.cse2 (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse1 v_ArrVal_1455))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (select (select .cse5 .cse6) .cse7))) (select (select (store .cse0 .cse1 v_ArrVal_1461) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4)))))) (not (= v_ArrVal_1461 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_29| (select v_ArrVal_1461 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_29|))))))) is different from false [2023-11-06 22:15:00,995 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_29| Int) (v_ArrVal_1461 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1458)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (or (not (= v_ArrVal_1461 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_29| (select v_ArrVal_1461 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_29|)))) (< (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_29|) (= (let ((.cse7 (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)))) (store .cse11 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse1 v_ArrVal_1457)) (.cse4 (store (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)))) (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse1 v_ArrVal_1455))) (let ((.cse8 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select .cse4 .cse8) .cse9)) (.cse6 (select (select .cse7 .cse8) .cse9))) (select (select (store .cse0 .cse1 v_ArrVal_1461) (select (select .cse4 .cse5) .cse6)) (+ (select (select .cse7 .cse5) .cse6) 4))))) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2023-11-06 22:15:01,055 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_29| Int) (v_ArrVal_1461 (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_1456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1458)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse9) .cse11))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse11)))) (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|))) .cse1 v_ArrVal_1457)) (.cse2 (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse9)))) (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) .cse1 v_ArrVal_1455))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (select (select .cse5 .cse6) .cse7))) (select (select (store .cse0 .cse1 v_ArrVal_1461) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4)))))) (< (select (select |c_#memory_$Pointer$.offset| .cse9) .cse11) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_29|) (not (= v_ArrVal_1461 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_29| (select v_ArrVal_1461 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_29|)))))))) is different from false [2023-11-06 22:15:01,293 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_34| Int) (v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_29| Int) (v_ArrVal_1473 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_34| v_ArrVal_1473)) (.cse13 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_34| v_ArrVal_1471))) (let ((.cse1 (select (select .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_34| v_ArrVal_1456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1458)) (.cse4 (select (select .cse13 .cse1) .cse2))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_34| 1)) (< (select (select .cse0 .cse1) .cse2) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_34|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse8 (store (let ((.cse12 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_34| (store v_ArrVal_1473 0 .cse2)))) (store .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0))) .cse4 v_ArrVal_1457)) (.cse5 (store (let ((.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_34| (store v_ArrVal_1471 0 .cse1)))) (store .cse11 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_34|))) .cse4 v_ArrVal_1455))) (let ((.cse9 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select .cse5 .cse9) .cse10)) (.cse7 (select (select .cse8 .cse9) .cse10))) (select (select (store .cse3 .cse4 v_ArrVal_1461) (select (select .cse5 .cse6) .cse7)) (+ 4 (select (select .cse8 .cse6) .cse7))))))) (not (= (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_29| (select v_ArrVal_1461 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_29|)) v_ArrVal_1461))))))) is different from false [2023-11-06 22:15:01,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222927303] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:15:01,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:15:01,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 49 [2023-11-06 22:15:01,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524337503] [2023-11-06 22:15:01,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:15:01,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-06 22:15:01,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:01,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-06 22:15:01,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2622, Unknown=5, NotChecked=530, Total=3306 [2023-11-06 22:15:01,306 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 49 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 40 states have internal predecessors, (66), 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-06 22:15:07,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:15:07,147 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2023-11-06 22:15:07,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:15:07,147 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 40 states have internal predecessors, (66), 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 42 [2023-11-06 22:15:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:15:07,149 INFO L225 Difference]: With dead ends: 76 [2023-11-06 22:15:07,149 INFO L226 Difference]: Without dead ends: 74 [2023-11-06 22:15:07,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=281, Invalid=4290, Unknown=5, NotChecked=680, Total=5256 [2023-11-06 22:15:07,152 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 75 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:15:07,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 419 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-06 22:15:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-06 22:15:07,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2023-11-06 22:15:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 54 states have internal predecessors, (60), 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-06 22:15:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2023-11-06 22:15:07,178 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 42 [2023-11-06 22:15:07,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:15:07,178 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2023-11-06 22:15:07,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 40 states have internal predecessors, (66), 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-06 22:15:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2023-11-06 22:15:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-06 22:15:07,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:15:07,180 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:07,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:15:07,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-06 22:15:07,393 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:15:07,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:07,394 INFO L85 PathProgramCache]: Analyzing trace with hash 388837903, now seen corresponding path program 3 times [2023-11-06 22:15:07,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:07,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348914867] [2023-11-06 22:15:07,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:07,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:07,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:15:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:07,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:15:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:15:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:07,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:15:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-06 22:15:07,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:07,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348914867] [2023-11-06 22:15:07,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348914867] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:15:07,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375210508] [2023-11-06 22:15:07,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:15:07,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:15:07,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:15:07,538 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:15:07,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:15:08,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 22:15:08,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:15:08,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:15:08,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:15:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:15:08,064 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:15:08,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375210508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:08,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:15:08,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-06 22:15:08,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145836752] [2023-11-06 22:15:08,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:08,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:15:08,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:08,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:15:08,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:15:08,066 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:15:08,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:15:08,099 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2023-11-06 22:15:08,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:15:08,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2023-11-06 22:15:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:15:08,100 INFO L225 Difference]: With dead ends: 75 [2023-11-06 22:15:08,101 INFO L226 Difference]: Without dead ends: 48 [2023-11-06 22:15:08,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:15:08,102 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:15:08,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:15:08,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-06 22:15:08,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-06 22:15:08,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:15:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2023-11-06 22:15:08,126 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 44 [2023-11-06 22:15:08,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:15:08,126 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2023-11-06 22:15:08,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:15:08,126 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2023-11-06 22:15:08,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 22:15:08,127 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:15:08,127 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:08,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:15:08,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:15:08,334 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:15:08,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:08,335 INFO L85 PathProgramCache]: Analyzing trace with hash 810854004, now seen corresponding path program 1 times [2023-11-06 22:15:08,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:08,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592388111] [2023-11-06 22:15:08,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:08,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:08,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:15:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:08,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:15:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:15:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:15:08,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:08,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592388111] [2023-11-06 22:15:08,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592388111] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:15:08,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572648983] [2023-11-06 22:15:08,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:08,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:15:08,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:15:08,542 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:15:08,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:15:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:08,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:15:08,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:15:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:15:08,880 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:15:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:15:08,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572648983] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:15:08,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:15:08,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 11 [2023-11-06 22:15:08,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010374146] [2023-11-06 22:15:08,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:15:08,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:15:08,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:08,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:15:08,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:15:08,949 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:15:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:15:09,049 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2023-11-06 22:15:09,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:15:09,049 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2023-11-06 22:15:09,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:15:09,050 INFO L225 Difference]: With dead ends: 57 [2023-11-06 22:15:09,050 INFO L226 Difference]: Without dead ends: 54 [2023-11-06 22:15:09,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:15:09,051 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:15:09,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 169 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:15:09,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-06 22:15:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2023-11-06 22:15:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:15:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2023-11-06 22:15:09,064 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 45 [2023-11-06 22:15:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:15:09,065 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2023-11-06 22:15:09,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:15:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2023-11-06 22:15:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 22:15:09,066 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:15:09,066 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:09,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-06 22:15:09,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 22:15:09,273 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:15:09,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:09,274 INFO L85 PathProgramCache]: Analyzing trace with hash -633288482, now seen corresponding path program 2 times [2023-11-06 22:15:09,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:09,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544126411] [2023-11-06 22:15:09,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:09,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:11,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:15:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:11,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:15:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:12,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:15:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:15:12,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:12,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544126411] [2023-11-06 22:15:12,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544126411] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:15:12,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905411817] [2023-11-06 22:15:12,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:15:12,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:15:12,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:15:12,320 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:15:12,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2545bb2e-f640-4187-81d1-3006216af479/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:15:12,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:15:12,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:15:12,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-06 22:15:12,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:15:12,626 INFO L351 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-06 22:15:12,711 INFO L351 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 9 treesize of output 5 [2023-11-06 22:15:12,716 INFO L351 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-06 22:15:12,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:12,891 INFO L351 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-06 22:15:12,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:12,904 INFO L351 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 18 treesize of output 13 [2023-11-06 22:15:12,914 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 22:15:12,915 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 22:15:13,654 INFO L322 Elim1Store]: treesize reduction 177, result has 19.2 percent of original size [2023-11-06 22:15:13,654 INFO L351 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 645 treesize of output 246 [2023-11-06 22:15:13,723 INFO L322 Elim1Store]: treesize reduction 148, result has 12.9 percent of original size [2023-11-06 22:15:13,723 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 287 treesize of output 138 [2023-11-06 22:15:15,862 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:15:15,863 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 36 case distinctions, treesize of input 290 treesize of output 541 [2023-11-06 22:15:16,494 INFO L322 Elim1Store]: treesize reduction 24, result has 93.1 percent of original size [2023-11-06 22:15:16,494 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 359 treesize of output 585