./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:24:49,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:24:49,355 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 05:24:49,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:24:49,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:24:49,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:24:49,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:24:49,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:24:49,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:24:49,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:24:49,402 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:24:49,403 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:24:49,403 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:24:49,404 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:24:49,404 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:24:49,404 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:24:49,404 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:24:49,404 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:24:49,404 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:24:49,404 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:24:49,404 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:24:49,404 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:24:49,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:24:49,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:24:49,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:24:49,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:24:49,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:24:49,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:24:49,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:24:49,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:24:49,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:24:49,405 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:24:49,405 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:24:49,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:24:49,406 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:24:49,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:24:49,406 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:24:49,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:24:49,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:24:49,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:24:49,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:24:49,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:24:49,406 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:24:49,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:24:49,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:24:49,407 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:24:49,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:24:49,407 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2024-11-14 05:24:49,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:24:49,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:24:49,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:24:49,709 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:24:49,710 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:24:49,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i Unable to find full path for "g++" [2024-11-14 05:24:51,612 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:24:52,021 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:24:52,022 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2024-11-14 05:24:52,038 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/data/d0579084c/c75b68f8767c44dd842859f9d0dba45b/FLAGa976f366e [2024-11-14 05:24:52,065 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/data/d0579084c/c75b68f8767c44dd842859f9d0dba45b [2024-11-14 05:24:52,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:24:52,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:24:52,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:24:52,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:24:52,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:24:52,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:24:52" (1/1) ... [2024-11-14 05:24:52,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa1c084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:52, skipping insertion in model container [2024-11-14 05:24:52,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:24:52" (1/1) ... [2024-11-14 05:24:52,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:24:52,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2024-11-14 05:24:52,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:24:52,523 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:24:52,610 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2024-11-14 05:24:52,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:24:52,640 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:24:52,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:52 WrapperNode [2024-11-14 05:24:52,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:24:52,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:24:52,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:24:52,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:24:52,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:52" (1/1) ... [2024-11-14 05:24:52,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:52" (1/1) ... [2024-11-14 05:24:52,689 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2024-11-14 05:24:52,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:24:52,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:24:52,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:24:52,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:24:52,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:52" (1/1) ... [2024-11-14 05:24:52,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:52" (1/1) ... [2024-11-14 05:24:52,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:52" (1/1) ... [2024-11-14 05:24:52,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:52" (1/1) ... [2024-11-14 05:24:52,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:52" (1/1) ... [2024-11-14 05:24:52,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:52" (1/1) ... [2024-11-14 05:24:52,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:52" (1/1) ... [2024-11-14 05:24:52,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:52" (1/1) ... [2024-11-14 05:24:52,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:24:52,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:24:52,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:24:52,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:24:52,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:52" (1/1) ... [2024-11-14 05:24:52,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:24:52,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:24:52,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:24:52,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:24:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:24:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:24:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 05:24:52,808 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 05:24:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:24:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:24:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 05:24:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:24:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:24:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:24:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 05:24:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:24:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:24:52,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:24:52,953 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:24:52,955 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:24:53,290 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-14 05:24:53,290 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:24:53,364 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:24:53,364 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-14 05:24:53,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:24:53 BoogieIcfgContainer [2024-11-14 05:24:53,365 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:24:53,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:24:53,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:24:53,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:24:53,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:24:52" (1/3) ... [2024-11-14 05:24:53,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ec050a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:24:53, skipping insertion in model container [2024-11-14 05:24:53,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:52" (2/3) ... [2024-11-14 05:24:53,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ec050a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:24:53, skipping insertion in model container [2024-11-14 05:24:53,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:24:53" (3/3) ... [2024-11-14 05:24:53,382 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2024-11-14 05:24:53,400 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:24:53,402 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_prepend_equal.i that has 2 procedures, 28 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-14 05:24:53,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:24:53,477 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@65ab5150, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:24:53,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 05:24:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:24:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 05:24:53,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:24:53,490 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:24:53,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:24:53,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:24:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash -974020612, now seen corresponding path program 1 times [2024-11-14 05:24:53,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:24:53,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724608290] [2024-11-14 05:24:53,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:24:53,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:24:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:24:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:24:53,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:24:53,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724608290] [2024-11-14 05:24:53,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724608290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:24:53,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:24:54,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:24:54,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579484937] [2024-11-14 05:24:54,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:24:54,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:24:54,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:24:54,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:24:54,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:24:54,028 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:24:54,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:24:54,106 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2024-11-14 05:24:54,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:24:54,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 17 [2024-11-14 05:24:54,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:24:54,114 INFO L225 Difference]: With dead ends: 53 [2024-11-14 05:24:54,114 INFO L226 Difference]: Without dead ends: 25 [2024-11-14 05:24:54,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:24:54,120 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:24:54,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:24:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-14 05:24:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2024-11-14 05:24:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:24:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-11-14 05:24:54,160 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 17 [2024-11-14 05:24:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:24:54,161 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-11-14 05:24:54,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:24:54,161 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-11-14 05:24:54,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 05:24:54,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:24:54,164 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:24:54,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:24:54,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:24:54,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:24:54,166 INFO L85 PathProgramCache]: Analyzing trace with hash -342613433, now seen corresponding path program 1 times [2024-11-14 05:24:54,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:24:54,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129987881] [2024-11-14 05:24:54,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:24:54,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:24:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:24:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:24:55,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:24:55,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129987881] [2024-11-14 05:24:55,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129987881] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:24:55,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605641465] [2024-11-14 05:24:55,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:24:55,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:24:55,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:24:55,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:24:55,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:24:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:24:55,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 05:24:55,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:24:55,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-14 05:24:55,475 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_14| Int)) (and (<= (+ |v_node_create_~temp~0#1.base_14| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_14| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_14|)) |c_#memory_$Pointer$.base|))) is different from true [2024-11-14 05:24:55,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:24:55,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-14 05:24:55,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-14 05:24:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-11-14 05:24:55,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:24:55,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605641465] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:24:55,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2017826925] [2024-11-14 05:24:55,659 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 05:24:55,659 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:24:55,662 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:24:55,667 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:24:55,668 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:24:57,663 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:24:57,681 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:25:07,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2017826925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:07,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:25:07,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13, 13] total 29 [2024-11-14 05:25:07,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592029588] [2024-11-14 05:25:07,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:07,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 05:25:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:07,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 05:25:07,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=729, Unknown=10, NotChecked=54, Total=870 [2024-11-14 05:25:07,087 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:25:09,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:09,157 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2024-11-14 05:25:09,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:25:09,158 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 23 [2024-11-14 05:25:09,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:09,159 INFO L225 Difference]: With dead ends: 28 [2024-11-14 05:25:09,159 INFO L226 Difference]: Without dead ends: 26 [2024-11-14 05:25:09,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=77, Invalid=729, Unknown=10, NotChecked=54, Total=870 [2024-11-14 05:25:09,160 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:09,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 78 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 297 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2024-11-14 05:25:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-14 05:25:09,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-14 05:25:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:25:09,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-14 05:25:09,168 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 23 [2024-11-14 05:25:09,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:09,168 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-14 05:25:09,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:25:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-14 05:25:09,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 05:25:09,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:09,169 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:09,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:25:09,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:09,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:25:09,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:09,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1461004477, now seen corresponding path program 1 times [2024-11-14 05:25:09,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:09,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946874173] [2024-11-14 05:25:09,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:09,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:25:09,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:09,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946874173] [2024-11-14 05:25:09,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946874173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:09,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135087100] [2024-11-14 05:25:09,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:09,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:09,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:25:09,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:25:09,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:25:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:10,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 05:25:10,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:10,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-14 05:25:10,192 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_24| Int)) (and (<= (+ |v_node_create_~temp~0#1.base_24| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_24| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_24|))))) is different from true [2024-11-14 05:25:10,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:10,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-14 05:25:10,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-14 05:25:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-11-14 05:25:10,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:25:10,261 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_29| Int) (v_ArrVal_300 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_29| v_ArrVal_300) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_29| 1)))) is different from false [2024-11-14 05:25:10,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135087100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:10,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [135627636] [2024-11-14 05:25:10,265 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 05:25:10,265 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:25:10,266 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:25:10,266 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:25:10,266 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:25:11,359 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:25:11,368 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:25:35,974 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '445#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| Int) (|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int))) (|v_#memory_int_27| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16| Int) (|v_#memory_int_92| (Array Int (Array Int Int)))) (and (or (and (exists ((|v_#memory_$Pointer$.offset_66| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_25| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_42| (Array Int (Array Int Int))) (|v_#memory_int_91| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= (store |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_25| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_25|) (= (select (select (store |v_#memory_$Pointer$.offset_66| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_66| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_int_91| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_91| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_#memory_int_BEFORE_CALL_42| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0))) |v_#memory_int_BEFORE_CALL_42|))) (= |ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) (exists ((|v_#memory_$Pointer$.offset_63| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_63| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (store (select |v_#memory_$Pointer$.offset_63| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 4))) |v_#memory_$Pointer$.offset_67|)) (exists ((|v_#length_28| (Array Int Int))) (= |#length| (store |v_#length_28| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| 8))) (exists ((|v_#valid_40| (Array Int Int))) (and (= (store |v_#valid_40| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| 1) |#valid|) (= (select |v_#valid_40| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0))) (exists ((|v_#memory_$Pointer$.base_69| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_69| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (store (select |v_#memory_$Pointer$.base_69| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 0) 4 (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 4))) |v_#memory_$Pointer$.base_73|)) (not (= |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| 0)) (<= (+ |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_88| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int)))) (and (= |v_#memory_int_92| (store |v_#memory_int_45| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (select |v_#memory_int_45| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 4 1))) (= |v_#memory_int_45| (store |v_#memory_int_88| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (select |v_#memory_int_88| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 (select (select |v_#memory_int_45| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0))))))) (and (= |ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) (exists ((|v_#memory_$Pointer$.offset_63| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_63| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (store (select |v_#memory_$Pointer$.offset_63| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 4))) |v_#memory_$Pointer$.offset_67|)) (exists ((|v_#length_28| (Array Int Int))) (= |#length| (store |v_#length_28| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| 8))) (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_66| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_#memory_int_91| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= |v_old(#memory_int)_AFTER_CALL_26| (store |v_#memory_int_91| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_91| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_26| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_66| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_66| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_26| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_26|))) (exists ((|v_#valid_40| (Array Int Int))) (and (= (store |v_#valid_40| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| 1) |#valid|) (= (select |v_#valid_40| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0))) (exists ((|v_#memory_$Pointer$.base_69| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_69| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (store (select |v_#memory_$Pointer$.base_69| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 0) 4 (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 4))) |v_#memory_$Pointer$.base_73|)) (not (= |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| 0)) (<= (+ |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_88| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int)))) (and (= |v_#memory_int_92| (store |v_#memory_int_45| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (select |v_#memory_int_45| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 4 1))) (= |v_#memory_int_45| (store |v_#memory_int_88| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (select |v_#memory_int_88| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 (select (select |v_#memory_int_45| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0)))))))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16| (store (select |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) 0 0)) |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (select (store |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16| (store (select |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) 0 0)) |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 0))) (= (select (select |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) 0) 0) (= (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) 0) 0) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16| (store (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) 0 |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|)) |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (select (store |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16| (store (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) 0 |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|)) |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|))) (= (store |v_#memory_int_92| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16| (store (select |v_#memory_int_92| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) 0 (select (select |v_#memory_int_27| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) 0))) |v_#memory_int_27|) (= (store |v_#memory_int_27| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (select |v_#memory_int_27| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0))) |#memory_int|))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:25:35,975 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:25:35,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:25:35,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2024-11-14 05:25:35,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663674244] [2024-11-14 05:25:35,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:25:35,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 05:25:35,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:35,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 05:25:35,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=848, Unknown=7, NotChecked=118, Total=1056 [2024-11-14 05:25:35,977 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 15 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:25:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:36,396 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-11-14 05:25:36,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:25:36,396 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-11-14 05:25:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:36,397 INFO L225 Difference]: With dead ends: 34 [2024-11-14 05:25:36,397 INFO L226 Difference]: Without dead ends: 25 [2024-11-14 05:25:36,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=105, Invalid=1086, Unknown=7, NotChecked=134, Total=1332 [2024-11-14 05:25:36,399 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:36,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 110 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 30 Unchecked, 0.2s Time] [2024-11-14 05:25:36,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-14 05:25:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2024-11-14 05:25:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:25:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-14 05:25:36,405 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 25 [2024-11-14 05:25:36,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:36,405 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-14 05:25:36,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:25:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-11-14 05:25:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 05:25:36,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:36,406 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:36,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 05:25:36,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:36,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:25:36,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:36,607 INFO L85 PathProgramCache]: Analyzing trace with hash 5430860, now seen corresponding path program 1 times [2024-11-14 05:25:36,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:36,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631885005] [2024-11-14 05:25:36,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:36,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:38,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:38,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631885005] [2024-11-14 05:25:38,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631885005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:38,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286346662] [2024-11-14 05:25:38,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:38,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:38,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:25:38,274 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:25:38,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:25:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:38,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-14 05:25:38,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:38,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:25:38,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-14 05:25:38,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:25:38,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:25:39,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:25:39,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:39,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:25:39,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:39,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:25:39,208 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 05:25:39,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-14 05:25:40,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:40,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:40,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 45 treesize of output 55 [2024-11-14 05:25:40,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:40,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:40,192 INFO L349 Elim1Store]: treesize reduction 44, result has 24.1 percent of original size [2024-11-14 05:25:40,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 176 treesize of output 150 [2024-11-14 05:25:40,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 123 [2024-11-14 05:25:40,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 85 [2024-11-14 05:25:40,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:25:40,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2024-11-14 05:25:40,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:40,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:40,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2024-11-14 05:25:40,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:40,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:40,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-14 05:25:40,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-14 05:25:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:25:40,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:25:40,823 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (or (not (= (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_442 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_442)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_442) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_446) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_448) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_444))) (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_441) |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_449) |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_447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2024-11-14 05:25:41,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:25:41,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1896 treesize of output 1870 [2024-11-14 05:25:41,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 878 treesize of output 710 [2024-11-14 05:25:41,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 354 treesize of output 270 [2024-11-14 05:25:42,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 722 treesize of output 638 [2024-11-14 05:25:42,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 767 treesize of output 641 [2024-11-14 05:25:42,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 3 [2024-11-14 05:25:42,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 3 [2024-11-14 05:25:42,270 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:25:42,275 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:25:42,276 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:25:42,280 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:25:46,451 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse8 (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|)) (.cse22 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0))) (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (= (select (select (store (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| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|)) .cse1 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (forall ((v_ArrVal_456 (Array Int Int))) (< (select (select .cse2 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse1)) (not (= .cse1 (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|)) .cse1 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (forall ((v_ArrVal_456 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (let ((.cse4 (select (select (store (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| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|)) .cse5 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| .cse4)) (not (= .cse5 (select (select (store (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|)) .cse5 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (< (select (select .cse7 .cse5) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse5))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)))) (or .cse8 (forall ((v_ArrVal_441 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_455 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (= (select (select (store (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (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| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|))) .cse10 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (< (select (select .cse11 .cse10) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse10)))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_456 (Array Int Int))) (< (select (select .cse12 .cse13) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse13)) (not (= (select (select (store (let ((.cse14 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (store .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse14 |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|))) .cse13 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444)) (.cse16 (select (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_456 (Array Int Int))) (< (select (select .cse15 .cse16) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse16)) (= .cse16 (select (select (store (store .cse17 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse17 |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|)) .cse16 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse16 (select (select (store (store .cse17 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|)) .cse16 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (forall ((v_ArrVal_456 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (< (select (select .cse18 .cse19) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse19) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse20 (select (select (store (let ((.cse21 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (store .cse21 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse21 |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|))) .cse19 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| .cse20)) (= .cse19 .cse20)))) (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_449) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| .cse22) .cse19 v_ArrVal_447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (or .cse8 (forall ((v_ArrVal_441 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_455 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse23 (select (select (store (let ((.cse26 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (store .cse26 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse26 |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|))) .cse25 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (= .cse23 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| .cse23)) (< (select (select .cse24 .cse25) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse25))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (forall ((v_ArrVal_456 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| (select (select (store (let ((.cse27 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (store .cse27 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse27 |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|))) .cse28 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (< (select (select .cse29 .cse28) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse28) (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_449) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| .cse22) .cse28 v_ArrVal_447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse30 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444)) (.cse31 (select (select .cse33 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| (select (select (store (store .cse30 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse30 |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|)) .cse31 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_ArrVal_456 (Array Int Int))) (let ((.cse32 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_449) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| (store v_ArrVal_456 0 .cse32)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)) .cse31 v_ArrVal_447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (< (select (select .cse33 .cse31) .cse32) .cse31)))) (= .cse31 (select (select (store (store .cse30 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|)) .cse31 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse34 (select (select (store (let ((.cse37 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (store .cse37 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse37 |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|))) .cse36 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| .cse34) (= .cse34 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (forall ((v_ArrVal_456 (Array Int Int))) (< (select (select .cse35 .cse36) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse36))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (forall ((v_ArrVal_456 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (< (select (select .cse38 .cse39) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse39) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse40 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (or (not (= (select (select (store (store .cse40 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store v_ArrVal_444 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|)) .cse39 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|)) (= .cse39 (select (select (store (store .cse40 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse40 |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|)) .cse39 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse39 (select (select (store (store .cse40 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|)) .cse39 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse42 (select (select .cse41 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_456 (Array Int Int))) (< (select (select .cse41 .cse42) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse42)) (not (= .cse42 (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|)) .cse42 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (or .cse8 (forall ((v_ArrVal_441 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse43 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse44 (select (select .cse43 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (< (select (select .cse43 .cse44) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse44) (= .cse44 (select (select (store (let ((.cse45 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (store .cse45 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse45 |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|))) .cse44 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (forall ((v_ArrVal_456 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse47 (select (select .cse48 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse46 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| (select (select (store (store .cse46 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse46 |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|)) .cse47 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= .cse47 (select (select (store (store .cse46 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|)) .cse47 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (< (select (select .cse48 .cse47) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse47))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse50 (select (select .cse49 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse51 (select (select (store (let ((.cse52 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (store .cse52 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse52 |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|))) .cse50 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_456 (Array Int Int))) (< (select (select .cse49 .cse50) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse50)) (= .cse50 .cse51) (not (= .cse51 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse54 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse55 (select (select .cse54 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse53 (select (select (store (let ((.cse56 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (store .cse56 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse56 |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|))) .cse55 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| .cse53) (forall ((v_ArrVal_456 (Array Int Int))) (< (select (select .cse54 .cse55) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse55)) (= .cse55 .cse53)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse59 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse57 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444)) (.cse58 (select (select .cse59 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| (select (select (store (store .cse57 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse57 |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|)) .cse58 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_ArrVal_456 (Array Int Int))) (< (select (select .cse59 .cse58) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse58)) (= .cse58 (select (select (store (store .cse57 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|)) .cse58 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)))) (or .cse8 (forall ((v_ArrVal_441 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_455 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse62 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse61 (select (select .cse62 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| (select (select (store (let ((.cse60 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (store .cse60 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse60 |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|))) .cse61 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (< (select (select .cse62 .cse61) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse61)))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse65 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse64 (select (select .cse65 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_456 (Array Int Int))) (let ((.cse63 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_449) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| (store v_ArrVal_456 0 .cse63)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)) .cse64 v_ArrVal_447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (< (select (select .cse65 .cse64) .cse63) .cse64)))) (= (select (select (store (let ((.cse66 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (store .cse66 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse66 |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|))) .cse64 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))))))) (or .cse8 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (let ((.cse67 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse68 (select (select .cse67 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (< (select (select .cse67 .cse68) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse68)))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (forall ((v_ArrVal_456 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse71 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse69 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse70 (select (select .cse71 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_449) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| (store v_ArrVal_456 0 .cse69)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)) .cse70 v_ArrVal_447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (< (select (select .cse71 .cse70) .cse69) .cse70))))))) (or (forall ((v_ArrVal_441 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse73 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse74 (select (select .cse73 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse72 (select (select (store (let ((.cse75 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (store .cse75 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse75 |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|))) .cse74 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| .cse72)) (< (select (select .cse73 .cse74) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse74) (= .cse74 .cse72)))))) .cse8) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse78 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse77 (select (select .cse78 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| (select (select (store (let ((.cse76 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (store .cse76 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse76 |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|))) .cse77 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_ArrVal_456 (Array Int Int))) (< (select (select .cse78 .cse77) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse77)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (forall ((v_ArrVal_456 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse82 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse81 (select (select .cse82 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse79 (select (select (store (let ((.cse80 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (store .cse80 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse80 |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|))) .cse81 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse79 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (not (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| .cse79))))) (< (select (select .cse82 .cse81) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse81) (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_449) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| .cse22) .cse81 v_ArrVal_447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse85 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_455))) (let ((.cse84 (select (select .cse85 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_456 (Array Int Int))) (let ((.cse83 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_449) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| (store v_ArrVal_456 0 .cse83)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)) .cse84 v_ArrVal_447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (< (select (select .cse85 .cse84) .cse83) .cse84)))) (= .cse84 (select (select (store (let ((.cse86 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_444))) (store .cse86 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse86 |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|))) .cse84 v_ArrVal_441) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from true [2024-11-14 05:25:46,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286346662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:46,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [930587052] [2024-11-14 05:25:46,459 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-14 05:25:46,459 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:25:46,460 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:25:46,460 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:25:46,460 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:25:47,447 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:25:47,454 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:26:17,509 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '698#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_88| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19| Int) (|v_#memory_int_28| (Array Int (Array Int Int))) (|v_#memory_int_29| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_82| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int)))) (and (or (and (= |ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) (exists ((|v_#memory_$Pointer$.base_84| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_84| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (store (select |v_#memory_$Pointer$.base_84| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0 0) 4 (select (select |v_#memory_$Pointer$.base_88| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 4))) |v_#memory_$Pointer$.base_88|)) (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_38| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_87| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_38| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_81| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_81| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_81| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_38| (store |v_#memory_int_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_38| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (= (store |v_#memory_$Pointer$.base_87| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_87| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_38|))) (exists ((|v_#memory_$Pointer$.offset_78| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_78| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (store (select |v_#memory_$Pointer$.offset_78| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_82| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 4))) |v_#memory_$Pointer$.offset_82|)) (exists ((|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_116| (Array Int (Array Int Int)))) (and (= |v_#memory_int_45| (store |v_#memory_int_116| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (select |v_#memory_int_116| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0 (select (select |v_#memory_int_45| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0)))) (= (store |v_#memory_int_45| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (select |v_#memory_int_45| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 4 1)) |v_#memory_int_120|))) (exists ((|v_#length_35| (Array Int Int))) (= |#length| (store |v_#length_35| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) 8))) (exists ((|v_#valid_50| (Array Int Int))) (and (= (select |v_#valid_50| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0) (= (store |v_#valid_50| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) 1) |#valid|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) 1) |#StackHeapBarrier|)) (and (= |ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) (exists ((|v_#memory_$Pointer$.base_84| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_84| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (store (select |v_#memory_$Pointer$.base_84| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0 0) 4 (select (select |v_#memory_$Pointer$.base_88| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 4))) |v_#memory_$Pointer$.base_88|)) (exists ((|v_#memory_$Pointer$.offset_78| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_78| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (store (select |v_#memory_$Pointer$.offset_78| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_82| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 4))) |v_#memory_$Pointer$.offset_82|)) (exists ((|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_116| (Array Int (Array Int Int)))) (and (= |v_#memory_int_45| (store |v_#memory_int_116| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (select |v_#memory_int_116| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0 (select (select |v_#memory_int_45| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0)))) (= (store |v_#memory_int_45| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (select |v_#memory_int_45| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 4 1)) |v_#memory_int_120|))) (exists ((|v_#length_35| (Array Int Int))) (= |#length| (store |v_#length_35| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) 8))) (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_87| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_39| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_39| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_81| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_81| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_81| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_39| (store |v_#memory_int_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_39| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| (store |v_#memory_$Pointer$.base_87| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_87| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| |ULTIMATE.start_main_~#s~0#1.base|) 0)))))) (exists ((|v_#valid_50| (Array Int Int))) (and (= (select |v_#valid_50| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0) (= (store |v_#valid_50| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) 1) |#valid|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) 1) |#StackHeapBarrier|))) (= |#memory_$Pointer$.offset| (store (store (store |v_#memory_$Pointer$.offset_82| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (select |v_#memory_$Pointer$.offset_82| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0 (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19| (store (select (store |v_#memory_$Pointer$.offset_82| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (select |v_#memory_$Pointer$.offset_82| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0 (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0 0)) (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0) (store (select (store (store |v_#memory_$Pointer$.offset_82| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (select |v_#memory_$Pointer$.offset_82| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0 (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19| (store (select (store |v_#memory_$Pointer$.offset_82| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (select |v_#memory_$Pointer$.offset_82| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0 (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0 0)) (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0) 0))) (= (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0) (select (select |v_#memory_$Pointer$.offset_82| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) (= |v_#memory_int_28| (store |v_#memory_int_29| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19| (store (select |v_#memory_int_29| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0 (select (select |v_#memory_int_28| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)))) (= |#memory_$Pointer$.base| (store (store (store |v_#memory_$Pointer$.base_88| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (select |v_#memory_$Pointer$.base_88| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0 (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19| (store (select (store |v_#memory_$Pointer$.base_88| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (select |v_#memory_$Pointer$.base_88| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0 (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0 (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)))) (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0) (store (select (store (store |v_#memory_$Pointer$.base_88| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (select |v_#memory_$Pointer$.base_88| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0 (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19| (store (select (store |v_#memory_$Pointer$.base_88| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (select |v_#memory_$Pointer$.base_88| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0 (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0 (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)))) (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))))) (= |#memory_int| (store |v_#memory_int_28| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0) (store (select |v_#memory_int_28| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0) (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))))) (= (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0) (select (select |v_#memory_$Pointer$.base_88| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) (= (store |v_#memory_int_120| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (store (select |v_#memory_int_120| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0 (select (select |v_#memory_int_29| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0)) (select (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_19|) 0))) 0))) |v_#memory_int_29|))))' at error location [2024-11-14 05:26:17,509 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:26:17,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:26:17,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2024-11-14 05:26:17,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959664984] [2024-11-14 05:26:17,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:17,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-14 05:26:17,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:17,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-14 05:26:17,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3481, Unknown=8, NotChecked=238, Total=3906 [2024-11-14 05:26:17,513 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 36 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 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) [2024-11-14 05:26:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:21,637 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2024-11-14 05:26:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-14 05:26:21,638 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 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 26 [2024-11-14 05:26:21,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:21,640 INFO L225 Difference]: With dead ends: 57 [2024-11-14 05:26:21,640 INFO L226 Difference]: Without dead ends: 49 [2024-11-14 05:26:21,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=353, Invalid=6125, Unknown=10, NotChecked=318, Total=6806 [2024-11-14 05:26:21,644 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 83 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:21,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 404 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-14 05:26:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-14 05:26:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2024-11-14 05:26:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 05:26:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2024-11-14 05:26:21,656 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 26 [2024-11-14 05:26:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:21,656 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-11-14 05:26:21,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 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) [2024-11-14 05:26:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-11-14 05:26:21,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:26:21,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:21,657 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:21,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 05:26:21,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:21,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:26:21,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash 482325255, now seen corresponding path program 1 times [2024-11-14 05:26:21,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:21,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590623654] [2024-11-14 05:26:21,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:21,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:26:24,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:24,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590623654] [2024-11-14 05:26:24,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590623654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:24,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550060794] [2024-11-14 05:26:24,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:24,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:24,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:24,722 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:24,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:26:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:24,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-11-14 05:26:24,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:24,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:26:25,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:26:25,527 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:26:25,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:26:25,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:26:25,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:26:25,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 05:26:25,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 05:26:26,117 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 05:26:26,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2024-11-14 05:26:26,139 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:26:26,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 05:26:26,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:26:26,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 05:26:26,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:26,467 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 05:26:26,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 43 [2024-11-14 05:26:26,500 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-14 05:26:26,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-14 05:26:26,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:26,587 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:26:26,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 05:26:28,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:28,605 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2024-11-14 05:26:28,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 61 [2024-11-14 05:26:28,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2024-11-14 05:26:28,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:28,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:28,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-11-14 05:26:28,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:28,732 INFO L349 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2024-11-14 05:26:28,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 94 [2024-11-14 05:26:28,802 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-14 05:26:28,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 141 [2024-11-14 05:26:29,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 21 [2024-11-14 05:26:29,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:29,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 21 [2024-11-14 05:26:30,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:30,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:30,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:30,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:30,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2024-11-14 05:26:30,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:30,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:30,142 INFO L349 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2024-11-14 05:26:30,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 66 [2024-11-14 05:26:30,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:30,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:30,269 INFO L349 Elim1Store]: treesize reduction 63, result has 31.5 percent of original size [2024-11-14 05:26:30,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 189 treesize of output 150 [2024-11-14 05:26:30,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:30,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:30,399 INFO L349 Elim1Store]: treesize reduction 37, result has 43.9 percent of original size [2024-11-14 05:26:30,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 66 [2024-11-14 05:26:30,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-14 05:26:30,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2024-11-14 05:26:30,577 INFO L349 Elim1Store]: treesize reduction 14, result has 56.3 percent of original size [2024-11-14 05:26:30,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 46 [2024-11-14 05:26:30,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:30,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-11-14 05:26:30,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:30,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2024-11-14 05:26:30,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2024-11-14 05:26:30,912 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-11-14 05:26:30,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 246 treesize of output 213 [2024-11-14 05:26:31,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 21 [2024-11-14 05:26:31,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-14 05:26:31,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-14 05:26:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:31,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:31,989 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_605) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_610))) (or (not (= v_ArrVal_608 (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_608 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)))) (not (= (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_605 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_605)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_608) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_609))) (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|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_604) |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_613) |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_611) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2024-11-14 05:26:32,082 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22| Int) (|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_21| Int)) (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_21|) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_605) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_610))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22| v_ArrVal_608) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_609))) (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|))) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22| v_ArrVal_604) |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_613) |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|)) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22| v_ArrVal_611) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (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_605 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_605)) (not (= v_ArrVal_608 (store (select .cse0 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_21| (select v_ArrVal_608 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_21|))))))) (< (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|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22|))) is different from false [2024-11-14 05:26:32,167 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22| Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_21| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_605) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_610)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse2 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22| v_ArrVal_608) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_609))) (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse3 |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|))) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22| v_ArrVal_604) |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_613) |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| .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.offset|)) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22| v_ArrVal_611) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (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_605 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_605)) (not (= v_ArrVal_608 (store (select .cse2 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_21| (select v_ArrVal_608 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_21|)))) (< (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_21|)))) is different from false [2024-11-14 05:26:32,214 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22| Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_21| Int)) (let ((.cse0 (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 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_605) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_610)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22|) (not (= v_ArrVal_605 (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_605 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))) (not (= v_ArrVal_608 (store (select .cse2 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_21| (select v_ArrVal_608 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_21|)))) (< (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_21|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse2 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22| v_ArrVal_608) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_609))) (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse3 |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|))) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22| v_ArrVal_604) |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_613) |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| .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.offset|)) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_22| v_ArrVal_611) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2024-11-14 05:26:32,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:32,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 11920 treesize of output 11614 [2024-11-14 05:26:32,638 INFO L349 Elim1Store]: treesize reduction 78, result has 52.4 percent of original size [2024-11-14 05:26:32,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 417 treesize of output 422 [2024-11-14 05:26:32,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-11-14 05:26:32,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:32,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 90 [2024-11-14 05:26:33,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:33,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 90 [2024-11-14 05:26:33,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:33,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 90 [2024-11-14 05:26:33,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:33,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 90 [2024-11-14 05:26:33,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:33,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 90 [2024-11-14 05:26:35,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 3 [2024-11-14 05:26:35,263 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-14 05:26:35,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2024-11-14 05:26:35,310 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:26:35,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:26:35,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 3 [2024-11-14 05:26:35,365 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:26:35,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:26:35,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2024-11-14 05:26:35,476 INFO L349 Elim1Store]: treesize reduction 79, result has 49.4 percent of original size [2024-11-14 05:26:35,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 132 [2024-11-14 05:26:35,538 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:26:35,544 INFO L349 Elim1Store]: treesize reduction 197, result has 0.5 percent of original size [2024-11-14 05:26:35,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2024-11-14 05:26:35,570 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:26:35,585 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:26:35,596 INFO L349 Elim1Store]: treesize reduction 321, result has 0.3 percent of original size [2024-11-14 05:26:35,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 1 [2024-11-14 05:26:35,645 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:26:35,685 INFO L349 Elim1Store]: treesize reduction 848, result has 0.1 percent of original size [2024-11-14 05:26:35,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 1 [2024-11-14 05:26:35,696 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:26:35,706 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:26:35,713 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:26:35,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:26:35,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 700 treesize of output 595 [2024-11-14 05:26:36,119 INFO L349 Elim1Store]: treesize reduction 124, result has 39.8 percent of original size [2024-11-14 05:26:36,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 130 [2024-11-14 05:26:36,353 INFO L349 Elim1Store]: treesize reduction 240, result has 32.0 percent of original size [2024-11-14 05:26:36,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 90 treesize of output 161 [2024-11-14 05:26:36,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:36,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 681 treesize of output 589 [2024-11-14 05:26:36,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:36,655 INFO L349 Elim1Store]: treesize reduction 155, result has 0.6 percent of original size [2024-11-14 05:26:36,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 1 [2024-11-14 05:26:37,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:37,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 638 treesize of output 533 [2024-11-14 05:26:37,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-14 05:26:38,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550060794] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:38,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1419469519] [2024-11-14 05:26:38,589 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-14 05:26:38,590 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:26:38,590 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:26:38,590 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:26:38,590 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:26:39,167 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:26:39,175 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:26:52,514 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1051#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26| Int) (|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25| Int) (|v_#memory_$Pointer$.offset_99| (Array Int (Array Int Int))) (|v_#memory_int_148| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_105| (Array Int (Array Int Int))) (|v_#memory_int_28| (Array Int (Array Int Int))) (|v_#memory_int_29| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22| Int)) (and (= |#memory_$Pointer$.base| (store (store (store |v_#memory_$Pointer$.base_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|) (store (select |v_#memory_$Pointer$.base_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|)) 0 (select (select |v_#memory_$Pointer$.base_105| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22| (store (select (store |v_#memory_$Pointer$.base_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|) (store (select |v_#memory_$Pointer$.base_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|)) 0 (select (select |v_#memory_$Pointer$.base_105| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|))) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26| (store (select (store (store |v_#memory_$Pointer$.base_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|) (store (select |v_#memory_$Pointer$.base_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|)) 0 (select (select |v_#memory_$Pointer$.base_105| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22| (store (select (store |v_#memory_$Pointer$.base_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|) (store (select |v_#memory_$Pointer$.base_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|)) 0 (select (select |v_#memory_$Pointer$.base_105| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|))) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|)))) (<= 2 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) (= |v_#memory_int_28| (store |v_#memory_int_29| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22| (store (select |v_#memory_int_29| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) 0 (select (select |v_#memory_int_28| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) 0)))) (= |#memory_$Pointer$.offset| (store (store (store |v_#memory_$Pointer$.offset_99| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|) (store (select |v_#memory_$Pointer$.offset_99| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|)) 0 (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22| (store (select (store |v_#memory_$Pointer$.offset_99| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|) (store (select |v_#memory_$Pointer$.offset_99| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|)) 0 (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) 0 0)) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26| (store (select (store (store |v_#memory_$Pointer$.offset_99| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|) (store (select |v_#memory_$Pointer$.offset_99| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|)) 0 (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22| (store (select (store |v_#memory_$Pointer$.offset_99| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|) (store (select |v_#memory_$Pointer$.offset_99| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|)) 0 (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) 0 0)) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25| 0))) (= |v_#memory_int_29| (store |v_#memory_int_148| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|) (store (select |v_#memory_int_148| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|)) 0 (select (select |v_#memory_int_29| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|)) 0)))) (= (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) 0) (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|)) (= (select (select |v_#memory_$Pointer$.base_105| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_22|) 0) (select (select |v_#memory_$Pointer$.base_105| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|)) (= |#memory_int| (store |v_#memory_int_28| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26| (store (select |v_#memory_int_28| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25| (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_25|)))))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:26:52,514 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:26:52,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:26:52,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2024-11-14 05:26:52,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477067704] [2024-11-14 05:26:52,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:52,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 05:26:52,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:52,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 05:26:52,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3871, Unknown=6, NotChecked=508, Total=4556 [2024-11-14 05:26:52,517 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 43 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 05:26:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:58,086 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2024-11-14 05:26:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 05:26:58,087 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2024-11-14 05:26:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:58,088 INFO L225 Difference]: With dead ends: 58 [2024-11-14 05:26:58,088 INFO L226 Difference]: Without dead ends: 56 [2024-11-14 05:26:58,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=355, Invalid=6297, Unknown=6, NotChecked=652, Total=7310 [2024-11-14 05:26:58,090 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 126 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:58,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 256 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-14 05:26:58,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-14 05:26:58,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 37. [2024-11-14 05:26:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 05:26:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2024-11-14 05:26:58,103 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 28 [2024-11-14 05:26:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:58,104 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-11-14 05:26:58,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 05:26:58,104 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-11-14 05:26:58,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 05:26:58,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:58,105 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:58,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 05:26:58,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:58,306 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:26:58,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:58,306 INFO L85 PathProgramCache]: Analyzing trace with hash -341866115, now seen corresponding path program 1 times [2024-11-14 05:26:58,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:58,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733892236] [2024-11-14 05:26:58,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:58,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:27:00,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:27:00,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733892236] [2024-11-14 05:27:00,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733892236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:27:00,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899720480] [2024-11-14 05:27:00,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:00,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:00,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:27:00,363 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:27:00,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:27:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:00,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-11-14 05:27:00,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:27:00,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:27:00,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:27:01,021 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:27:01,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:27:01,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:27:01,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 05:27:01,500 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:27:01,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 25 [2024-11-14 05:27:01,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:27:01,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:27:01,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:01,746 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-14 05:27:01,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 46 [2024-11-14 05:27:01,800 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-14 05:27:01,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-14 05:27:01,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:01,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:27:03,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:03,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:03,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 180 [2024-11-14 05:27:03,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:03,899 INFO L349 Elim1Store]: treesize reduction 202, result has 20.5 percent of original size [2024-11-14 05:27:03,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 353 treesize of output 186 [2024-11-14 05:27:03,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:03,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:03,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:03,969 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-11-14 05:27:03,969 INFO L378 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 2 case distinctions, treesize of input 156 treesize of output 147 [2024-11-14 05:27:04,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 193 [2024-11-14 05:27:04,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:04,438 INFO L349 Elim1Store]: treesize reduction 132, result has 0.8 percent of original size [2024-11-14 05:27:04,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 96 [2024-11-14 05:27:04,451 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:27:05,184 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-14 05:27:05,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 344 treesize of output 126 [2024-11-14 05:27:05,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:05,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:05,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 87 [2024-11-14 05:27:05,307 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:27:05,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:27:07,592 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int)) (v_ArrVal_771 Int)) (let ((.cse0 (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|) |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 .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.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_767)) (.cse3 (let ((.cse4 (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|) |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 .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|))))) (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| v_ArrVal_771))))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse2)) (not (= .cse1 (select (select .cse3 .cse1) .cse2))))))) is different from false [2024-11-14 05:27:11,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899720480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:27:11,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1511110946] [2024-11-14 05:27:11,715 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 05:27:11,715 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:27:11,715 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:27:11,715 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:27:11,715 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:27:12,329 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:27:12,336 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:27:30,766 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1417#(and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 1) (exists ((|v_#memory_int_169| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34| Int) (|v_#memory_int_28| (Array Int (Array Int Int))) (|v_#memory_int_29| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25| Int) (|v_#memory_$Pointer$.base_122| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33| Int) (|v_#memory_$Pointer$.offset_114| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_114| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|) (select (select |v_#memory_$Pointer$.offset_114| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) 0)) (= |v_#memory_int_28| (store |v_#memory_int_29| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25| (store (select |v_#memory_int_29| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) 0 (select (select |v_#memory_int_28| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) 0)))) (<= 2 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) (= |#memory_int| (store |v_#memory_int_28| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34| (store (select |v_#memory_int_28| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33| (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|)))) (= (select (select |v_#memory_$Pointer$.base_122| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|) (select (select |v_#memory_$Pointer$.base_122| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) 0)) (= |#memory_$Pointer$.offset| (store (store (store |v_#memory_$Pointer$.offset_114| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|) (store (select |v_#memory_$Pointer$.offset_114| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|)) 0 (select (select |v_#memory_$Pointer$.offset_114| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25| (store (select (store |v_#memory_$Pointer$.offset_114| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|) (store (select |v_#memory_$Pointer$.offset_114| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|)) 0 (select (select |v_#memory_$Pointer$.offset_114| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) 0 0)) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34| (store (select (store (store |v_#memory_$Pointer$.offset_114| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|) (store (select |v_#memory_$Pointer$.offset_114| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|)) 0 (select (select |v_#memory_$Pointer$.offset_114| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25| (store (select (store |v_#memory_$Pointer$.offset_114| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|) (store (select |v_#memory_$Pointer$.offset_114| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|)) 0 (select (select |v_#memory_$Pointer$.offset_114| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) 0 0)) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33| 0))) (= (store |v_#memory_int_169| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|) (store (select |v_#memory_int_169| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|)) 0 (select (select |v_#memory_int_29| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|)) 0))) |v_#memory_int_29|) (= (store (store (store |v_#memory_$Pointer$.base_122| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|) (store (select |v_#memory_$Pointer$.base_122| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|)) 0 (select (select |v_#memory_$Pointer$.base_122| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25| (store (select (store |v_#memory_$Pointer$.base_122| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|) (store (select |v_#memory_$Pointer$.base_122| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|)) 0 (select (select |v_#memory_$Pointer$.base_122| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|))) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34| (store (select (store (store |v_#memory_$Pointer$.base_122| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|) (store (select |v_#memory_$Pointer$.base_122| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|)) 0 (select (select |v_#memory_$Pointer$.base_122| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25| (store (select (store |v_#memory_$Pointer$.base_122| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|) (store (select |v_#memory_$Pointer$.base_122| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|)) 0 (select (select |v_#memory_$Pointer$.base_122| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_25|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|))) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_34|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_33|))) |#memory_$Pointer$.base|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))))' at error location [2024-11-14 05:27:30,766 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:27:30,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:27:30,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 43 [2024-11-14 05:27:30,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083653526] [2024-11-14 05:27:30,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:27:30,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 05:27:30,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:27:30,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 05:27:30,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=4887, Unknown=4, NotChecked=140, Total=5256 [2024-11-14 05:27:30,770 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 43 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 05:27:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:27:36,217 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2024-11-14 05:27:36,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-14 05:27:36,218 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 30 [2024-11-14 05:27:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:27:36,219 INFO L225 Difference]: With dead ends: 88 [2024-11-14 05:27:36,219 INFO L226 Difference]: Without dead ends: 85 [2024-11-14 05:27:36,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2228 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=437, Invalid=8119, Unknown=4, NotChecked=182, Total=8742 [2024-11-14 05:27:36,222 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 132 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:27:36,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 411 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-14 05:27:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-14 05:27:36,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 58. [2024-11-14 05:27:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-14 05:27:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2024-11-14 05:27:36,245 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 30 [2024-11-14 05:27:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:27:36,245 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2024-11-14 05:27:36,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 05:27:36,245 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2024-11-14 05:27:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 05:27:36,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:27:36,246 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:27:36,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 05:27:36,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:36,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:27:36,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:27:36,447 INFO L85 PathProgramCache]: Analyzing trace with hash -783661822, now seen corresponding path program 2 times [2024-11-14 05:27:36,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:27:36,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294576374] [2024-11-14 05:27:36,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:36,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:27:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:27:38,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:27:38,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294576374] [2024-11-14 05:27:38,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294576374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:27:38,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667590380] [2024-11-14 05:27:38,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:27:38,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:38,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:27:38,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:27:38,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:27:38,566 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:27:38,566 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:27:38,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-14 05:27:38,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:27:38,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:27:38,874 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_67| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_67| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |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 [2024-11-14 05:27:38,877 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_67| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_67| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |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 [2024-11-14 05:27:38,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:27:38,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:27:38,927 WARN L851 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |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|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_67| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_67| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2024-11-14 05:27:38,930 WARN L873 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |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|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_67| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_67| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2024-11-14 05:27:38,971 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-14 05:27:38,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 42 [2024-11-14 05:27:38,996 INFO L349 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2024-11-14 05:27:38,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2024-11-14 05:27:39,027 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |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| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_67| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_67| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_67| .cse0) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)))) is different from false [2024-11-14 05:27:39,030 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |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| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_67| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_67| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_67| .cse0) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)))) is different from true [2024-11-14 05:27:39,080 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-11-14 05:27:39,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 48 [2024-11-14 05:27:39,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:39,102 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 05:27:39,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 05:27:39,141 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_61| Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_61| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_61|)) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_61|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_61| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_61|))) (<= (+ |v_node_create_~temp~0#1.base_61| 1) |c_#StackHeapBarrier|))) is different from true [2024-11-14 05:27:39,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:39,212 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-14 05:27:39,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 72 [2024-11-14 05:27:39,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:39,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:39,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:39,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:39,242 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 05:27:39,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 43 [2024-11-14 05:27:39,292 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |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| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (exists ((|v_node_create_~temp~0#1.base_61| Int) (|v_#valid_BEFORE_CALL_129| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (= (select |v_old(#valid)_AFTER_CALL_67| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_129| .cse1) 1) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |v_#valid_BEFORE_CALL_129| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse2 (select |v_#valid_BEFORE_CALL_129| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_67| .cse0) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0)))) is different from false [2024-11-14 05:27:39,295 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |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| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (exists ((|v_node_create_~temp~0#1.base_61| Int) (|v_#valid_BEFORE_CALL_129| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (= (select |v_old(#valid)_AFTER_CALL_67| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_129| .cse1) 1) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |v_#valid_BEFORE_CALL_129| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse2 (select |v_#valid_BEFORE_CALL_129| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_67| .cse0) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0)))) is different from true [2024-11-14 05:27:39,395 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |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| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (exists ((|v_node_create_~temp~0#1.base_61| Int) (|v_#valid_BEFORE_CALL_129| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (= (select |v_old(#valid)_AFTER_CALL_67| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_129| .cse1) 1) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |v_#valid_BEFORE_CALL_129| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse2 (select |v_#valid_BEFORE_CALL_129| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_67| .cse0) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1)))) is different from false [2024-11-14 05:27:39,399 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |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| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (exists ((|v_node_create_~temp~0#1.base_61| Int) (|v_#valid_BEFORE_CALL_129| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (= (select |v_old(#valid)_AFTER_CALL_67| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_129| .cse1) 1) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |v_#valid_BEFORE_CALL_129| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse2 (select |v_#valid_BEFORE_CALL_129| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_67| .cse0) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1)))) is different from true [2024-11-14 05:27:39,549 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |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| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (exists ((|v_node_create_~temp~0#1.base_61| Int) (|v_#valid_BEFORE_CALL_129| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (= (select |v_old(#valid)_AFTER_CALL_67| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_129| .cse1) 1) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |v_#valid_BEFORE_CALL_129| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse2 (select |v_#valid_BEFORE_CALL_129| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_67| .cse0) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0)))) is different from false [2024-11-14 05:27:39,554 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |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| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (exists ((|v_node_create_~temp~0#1.base_61| Int) (|v_#valid_BEFORE_CALL_129| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (= (select |v_old(#valid)_AFTER_CALL_67| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_129| .cse1) 1) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |v_#valid_BEFORE_CALL_129| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse2 (select |v_#valid_BEFORE_CALL_129| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_67| .cse0) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0)))) is different from true [2024-11-14 05:27:39,651 INFO L349 Elim1Store]: treesize reduction 48, result has 21.3 percent of original size [2024-11-14 05:27:39,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 60 [2024-11-14 05:27:39,994 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (or (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_129| (Array Int Int))) (and (exists ((|v_node_create_~temp~0#1.base_61| Int)) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.base| Int)) (and (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.offset| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (not (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)))) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |ULTIMATE.start_sll_circular_prepend_~head#1.base|))))) (= (select |v_#valid_BEFORE_CALL_129| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 1) (= |v_#valid_BEFORE_CALL_129| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse0 (select |v_#valid_BEFORE_CALL_129| .cse0)))))) (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_129| (Array Int Int))) (and (exists ((|v_node_create_~temp~0#1.base_61| Int)) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.base| Int)) (and (not (= |ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0)) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |ULTIMATE.start_sll_circular_prepend_~head#1.base|))))) (= (select |v_#valid_BEFORE_CALL_129| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 1) (= |v_#valid_BEFORE_CALL_129| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse1 (select |v_#valid_BEFORE_CALL_129| .cse1)))))) (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0))))) is different from false [2024-11-14 05:27:39,999 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (or (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_129| (Array Int Int))) (and (exists ((|v_node_create_~temp~0#1.base_61| Int)) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.base| Int)) (and (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.offset| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (not (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)))) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |ULTIMATE.start_sll_circular_prepend_~head#1.base|))))) (= (select |v_#valid_BEFORE_CALL_129| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 1) (= |v_#valid_BEFORE_CALL_129| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse0 (select |v_#valid_BEFORE_CALL_129| .cse0)))))) (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_129| (Array Int Int))) (and (exists ((|v_node_create_~temp~0#1.base_61| Int)) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.base| Int)) (and (not (= |ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0)) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |ULTIMATE.start_sll_circular_prepend_~head#1.base|))))) (= (select |v_#valid_BEFORE_CALL_129| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 1) (= |v_#valid_BEFORE_CALL_129| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse1 (select |v_#valid_BEFORE_CALL_129| .cse1)))))) (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0))))) is different from true [2024-11-14 05:27:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-14 05:27:40,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:27:40,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667590380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:27:40,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1395015210] [2024-11-14 05:27:40,259 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-14 05:27:40,259 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:27:40,259 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:27:40,259 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:27:40,259 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:27:40,762 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:27:40,769 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:27:49,105 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1839#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (exists ((|v_#memory_int_190| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_138| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27| Int) (|v_#memory_int_28| (Array Int (Array Int Int))) (|v_#memory_int_29| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42| Int) (|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42| Int)) (and (= |v_#memory_int_28| (store |v_#memory_int_29| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27| (store (select |v_#memory_int_29| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) 0 (select (select |v_#memory_int_28| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) 0)))) (= (store (store (store |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|) (store (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|)) 0 (select (select |v_#memory_$Pointer$.base_138| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27| (store (select (store |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|) (store (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|)) 0 (select (select |v_#memory_$Pointer$.base_138| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|))) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42| (store (select (store (store |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|) (store (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|)) 0 (select (select |v_#memory_$Pointer$.base_138| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27| (store (select (store |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|) (store (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|)) 0 (select (select |v_#memory_$Pointer$.base_138| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|))) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_28| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42| (store (select |v_#memory_int_28| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42| (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|)))) (<= 2 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) (= (store |v_#memory_int_190| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|) (store (select |v_#memory_int_190| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|)) 0 (select (select |v_#memory_int_29| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|)) 0))) |v_#memory_int_29|) (= (select (select |v_#memory_$Pointer$.base_138| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|) (select (select |v_#memory_$Pointer$.base_138| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) 0)) (= |#memory_$Pointer$.offset| (store (store (store |v_#memory_$Pointer$.offset_130| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|) (store (select |v_#memory_$Pointer$.offset_130| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|)) 0 (select (select |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27| (store (select (store |v_#memory_$Pointer$.offset_130| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|) (store (select |v_#memory_$Pointer$.offset_130| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|)) 0 (select (select |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) 0 0)) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42| (store (select (store (store |v_#memory_$Pointer$.offset_130| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|) (store (select |v_#memory_$Pointer$.offset_130| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|)) 0 (select (select |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27| (store (select (store |v_#memory_$Pointer$.offset_130| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|) (store (select |v_#memory_$Pointer$.offset_130| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|)) 0 (select (select |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) 0 0)) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42| 0))) (= (select (select |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_27|) 0) (select (select |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_42|)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:27:49,105 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:27:49,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:27:49,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 32 [2024-11-14 05:27:49,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173972707] [2024-11-14 05:27:49,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:27:49,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 05:27:49,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:27:49,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 05:27:49,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1684, Unknown=16, NotChecked=712, Total=2550 [2024-11-14 05:27:49,108 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 32 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 05:27:49,557 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_67| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_67| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |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 [2024-11-14 05:27:49,562 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_67| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_67| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |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 [2024-11-14 05:27:49,569 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= 0 .cse0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| .cse0) (= |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|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_67| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_67| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2024-11-14 05:27:49,574 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= 0 .cse0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| .cse0) (= |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|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_67| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_67| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2024-11-14 05:27:49,582 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |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| .cse1) 0)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse5) 0)) (.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) 0)) (.cse6 (+ |c_#StackHeapBarrier| 1))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_67| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_67| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_67| .cse0) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse3) 1) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) .cse5) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse5) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 0) (<= .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2024-11-14 05:27:49,588 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |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| .cse1) 0)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse5) 0)) (.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) 0)) (.cse6 (+ |c_#StackHeapBarrier| 1))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_67| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_67| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_67| .cse0) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse3) 1) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) .cse5) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse5) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 0) (<= .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2024-11-14 05:27:49,613 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse1)) (.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|)) (.cse7 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse7 0)) (.cse3 (select .cse7 .cse5)) (.cse4 (select .cse6 .cse5))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (exists ((|v_node_create_~temp~0#1.base_61| Int) (|v_#valid_BEFORE_CALL_129| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (= (select |v_old(#valid)_AFTER_CALL_67| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_129| .cse1) 1) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |v_#valid_BEFORE_CALL_129| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse2 (select |v_#valid_BEFORE_CALL_129| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_67| .cse0) 1))) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse5) (= .cse5 0) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (= (select .cse6 0) 0))))) is different from false [2024-11-14 05:27:49,617 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse1)) (.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|)) (.cse7 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse7 0)) (.cse3 (select .cse7 .cse5)) (.cse4 (select .cse6 .cse5))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (exists ((|v_node_create_~temp~0#1.base_61| Int) (|v_#valid_BEFORE_CALL_129| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (= (select |v_old(#valid)_AFTER_CALL_67| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_129| .cse1) 1) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |v_#valid_BEFORE_CALL_129| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse2 (select |v_#valid_BEFORE_CALL_129| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_67| .cse0) 1))) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse5) (= .cse5 0) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (= (select .cse6 0) 0))))) is different from true [2024-11-14 05:27:49,687 WARN L851 $PredicateComparison]: unable to prove that (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|))) (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|)) (.cse1 (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|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse2) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse4) (exists ((|v_node_create_~temp~0#1.base_61| Int) (|v_#valid_BEFORE_CALL_129| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (= (select |v_old(#valid)_AFTER_CALL_67| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_129| .cse2) 1) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |v_#valid_BEFORE_CALL_129| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse5 (select |v_#valid_BEFORE_CALL_129| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_67| .cse3) 1))) (= .cse4 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2)))) is different from false [2024-11-14 05:27:49,691 WARN L873 $PredicateComparison]: unable to prove that (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|))) (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|)) (.cse1 (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|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse2) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse4) (exists ((|v_node_create_~temp~0#1.base_61| Int) (|v_#valid_BEFORE_CALL_129| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (= (select |v_old(#valid)_AFTER_CALL_67| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_129| .cse2) 1) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |v_#valid_BEFORE_CALL_129| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse5 (select |v_#valid_BEFORE_CALL_129| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_67| .cse3) 1))) (= .cse4 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2)))) is different from true [2024-11-14 05:27:49,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |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| .cse1) 0)) (.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|))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (exists ((|v_node_create_~temp~0#1.base_61| Int) (|v_#valid_BEFORE_CALL_129| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (= (select |v_old(#valid)_AFTER_CALL_67| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_129| .cse1) 1) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |v_#valid_BEFORE_CALL_129| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse2 (select |v_#valid_BEFORE_CALL_129| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_67| .cse0) 1))) (= .cse3 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (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|) .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)))) is different from false [2024-11-14 05:27:49,713 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |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| .cse1) 0)) (.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|))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (exists ((|v_node_create_~temp~0#1.base_61| Int) (|v_#valid_BEFORE_CALL_129| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (= (select |v_old(#valid)_AFTER_CALL_67| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_129| .cse1) 1) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |v_#valid_BEFORE_CALL_129| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse2 (select |v_#valid_BEFORE_CALL_129| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_67| .cse0) 1))) (= .cse3 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (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|) .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)))) is different from true [2024-11-14 05:27:49,731 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (or (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_129| (Array Int Int))) (and (exists ((|v_node_create_~temp~0#1.base_61| Int)) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.base| Int)) (and (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.offset| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (not (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)))) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |ULTIMATE.start_sll_circular_prepend_~head#1.base|))))) (= (select |v_#valid_BEFORE_CALL_129| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 1) (= |v_#valid_BEFORE_CALL_129| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse0 (select |v_#valid_BEFORE_CALL_129| .cse0)))))) (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_129| (Array Int Int))) (and (exists ((|v_node_create_~temp~0#1.base_61| Int)) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.base| Int)) (and (not (= |ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0)) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |ULTIMATE.start_sll_circular_prepend_~head#1.base|))))) (= (select |v_#valid_BEFORE_CALL_129| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 1) (= |v_#valid_BEFORE_CALL_129| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse1 (select |v_#valid_BEFORE_CALL_129| .cse1)))))) (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0))))) is different from false [2024-11-14 05:27:49,738 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (or (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_129| (Array Int Int))) (and (exists ((|v_node_create_~temp~0#1.base_61| Int)) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.base| Int)) (and (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.offset| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (not (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)))) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |ULTIMATE.start_sll_circular_prepend_~head#1.base|))))) (= (select |v_#valid_BEFORE_CALL_129| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 1) (= |v_#valid_BEFORE_CALL_129| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse0 (select |v_#valid_BEFORE_CALL_129| .cse0)))))) (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_67| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_129| (Array Int Int))) (and (exists ((|v_node_create_~temp~0#1.base_61| Int)) (and (= (select |v_#valid_BEFORE_CALL_129| |v_node_create_~temp~0#1.base_61|) 0) (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.base| Int)) (and (not (= |ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0)) (<= (+ |v_node_create_~temp~0#1.base_61| 2) |ULTIMATE.start_sll_circular_prepend_~head#1.base|))))) (= (select |v_#valid_BEFORE_CALL_129| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 1) (= |v_#valid_BEFORE_CALL_129| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_67| |v_#valid_BEFORE_CALL_129|))) (store |v_old(#valid)_AFTER_CALL_67| .cse1 (select |v_#valid_BEFORE_CALL_129| .cse1)))))) (= (select |v_old(#valid)_AFTER_CALL_67| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0))))) is different from true [2024-11-14 05:27:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:27:49,919 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-11-14 05:27:49,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 05:27:49,920 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 30 [2024-11-14 05:27:49,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:27:49,922 INFO L225 Difference]: With dead ends: 68 [2024-11-14 05:27:49,922 INFO L226 Difference]: Without dead ends: 58 [2024-11-14 05:27:49,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=165, Invalid=1845, Unknown=30, NotChecked=1500, Total=3540 [2024-11-14 05:27:49,924 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 562 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:27:49,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 204 Invalid, 0 Unknown, 562 Unchecked, 0.5s Time] [2024-11-14 05:27:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-14 05:27:49,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-14 05:27:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-14 05:27:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2024-11-14 05:27:49,944 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 30 [2024-11-14 05:27:49,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:27:49,945 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2024-11-14 05:27:49,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 05:27:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2024-11-14 05:27:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:27:49,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:27:49,946 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:27:49,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 05:27:50,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:50,147 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:27:50,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:27:50,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2007871798, now seen corresponding path program 1 times [2024-11-14 05:27:50,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:27:50,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565885903] [2024-11-14 05:27:50,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:50,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:27:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:27:54,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:27:54,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565885903] [2024-11-14 05:27:54,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565885903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:27:54,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054948850] [2024-11-14 05:27:54,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:54,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:54,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:27:54,547 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:27:54,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 05:27:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:54,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-14 05:27:54,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:27:54,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:27:55,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:27:55,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:27:55,584 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:27:55,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:27:55,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:27:55,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:27:56,001 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-14 05:27:56,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 60 [2024-11-14 05:27:56,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-14 05:27:56,223 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:27:56,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 35 [2024-11-14 05:27:56,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:27:56,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:27:56,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:27:56,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:56,614 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 05:27:56,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 61 [2024-11-14 05:27:56,661 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 05:27:56,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-14 05:27:56,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 05:27:56,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:56,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:27:58,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:58,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2024-11-14 05:27:58,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:58,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:58,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 78 [2024-11-14 05:27:58,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:58,585 INFO L349 Elim1Store]: treesize reduction 160, result has 8.6 percent of original size [2024-11-14 05:27:58,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 187 treesize of output 97 [2024-11-14 05:27:58,657 INFO L349 Elim1Store]: treesize reduction 102, result has 13.6 percent of original size [2024-11-14 05:27:58,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 291 treesize of output 164 [2024-11-14 05:27:58,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-14 05:27:58,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:58,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:58,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:58,701 INFO L378 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 [2024-11-14 05:27:59,250 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2024-11-14 05:27:59,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 55 [2024-11-14 05:27:59,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:59,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:27:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:27:59,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:27:59,963 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1093 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (v_ArrVal_1085 (Array Int Int)) (v_ArrVal_1084 (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_1087)) (.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_1084))) (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_1088) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1085) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1093) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) is different from false [2024-11-14 05:28:24,643 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1093 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_45| Int) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (v_ArrVal_1085 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_41| Int) (v_ArrVal_1084 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_41| v_ArrVal_1102))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse9 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_41| v_ArrVal_1103) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select .cse0 .cse2) .cse9))) (or (not (= (select (select .cse0 .cse1) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_45|) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_41|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_41| (store v_ArrVal_1103 |ULTIMATE.start_sll_circular_prepend_~new_head~1#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| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse1 v_ArrVal_1087)) (.cse3 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_41| (store v_ArrVal_1102 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)))) (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_41|))) .cse1 v_ArrVal_1084))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |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_41| v_ArrVal_1088) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1085) .cse1 v_ArrVal_1093) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 4))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_41| 1))))))) is different from false [2024-11-14 05:28:24,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054948850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:28:24,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1452691814] [2024-11-14 05:28:24,649 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 05:28:24,650 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:28:24,650 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:28:24,650 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:28:24,650 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:28:25,235 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:28:25,242 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:28:42,668 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2242#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:28:42,669 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:28:42,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:28:42,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 48 [2024-11-14 05:28:42,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767098598] [2024-11-14 05:28:42,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:28:42,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-14 05:28:42,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:28:42,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-14 05:28:42,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=5089, Unknown=116, NotChecked=290, Total=5700 [2024-11-14 05:28:42,671 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand has 48 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 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) [2024-11-14 05:28:48,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:28:56,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:28:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:28:58,123 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2024-11-14 05:28:58,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 05:28:58,124 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 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 31 [2024-11-14 05:28:58,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:28:58,126 INFO L225 Difference]: With dead ends: 73 [2024-11-14 05:28:58,126 INFO L226 Difference]: Without dead ends: 71 [2024-11-14 05:28:58,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 56.3s TimeCoverageRelationStatistics Valid=393, Invalid=8220, Unknown=137, NotChecked=370, Total=9120 [2024-11-14 05:28:58,129 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:28:58,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 230 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1073 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2024-11-14 05:28:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-14 05:28:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2024-11-14 05:28:58,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-14 05:28:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2024-11-14 05:28:58,161 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 31 [2024-11-14 05:28:58,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:28:58,161 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2024-11-14 05:28:58,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 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) [2024-11-14 05:28:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2024-11-14 05:28:58,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:28:58,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:28:58,166 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:28:58,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 05:28:58,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:28:58,367 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:28:58,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:28:58,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1124450176, now seen corresponding path program 1 times [2024-11-14 05:28:58,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:28:58,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976679575] [2024-11-14 05:28:58,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:28:58,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:28:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:29:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:29:02,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:29:02,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976679575] [2024-11-14 05:29:02,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976679575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:29:02,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538485832] [2024-11-14 05:29:02,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:29:02,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:29:02,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:29:02,181 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:29:02,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 05:29:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:29:02,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-14 05:29:02,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:29:02,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:29:02,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:29:03,232 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:29:03,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:29:03,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:29:03,564 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-14 05:29:03,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 48 [2024-11-14 05:29:03,767 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:29:03,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 28 [2024-11-14 05:29:03,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:29:03,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:29:03,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:03,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:29:03,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:04,019 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 05:29:04,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 52 [2024-11-14 05:29:04,091 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 05:29:04,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-14 05:29:05,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:05,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2024-11-14 05:29:05,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:05,230 INFO L349 Elim1Store]: treesize reduction 59, result has 10.6 percent of original size [2024-11-14 05:29:05,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 63 [2024-11-14 05:29:05,292 INFO L349 Elim1Store]: treesize reduction 78, result has 17.0 percent of original size [2024-11-14 05:29:05,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 175 treesize of output 106 [2024-11-14 05:29:05,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:05,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:05,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 25 [2024-11-14 05:29:05,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:05,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-14 05:29:06,029 INFO L349 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2024-11-14 05:29:06,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 40 [2024-11-14 05:29:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:29:06,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:29:08,457 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1253 (Array Int Int))) (not (let ((.cse0 (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|) |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 .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_1253))) (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|) |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 .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.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1248))) (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 [2024-11-14 05:29:08,493 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1253 (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 ((.cse0 (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|) |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 .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_1253))) (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|) |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 .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.offset|))) .cse5 v_ArrVal_1248))) (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 [2024-11-14 05:29:10,519 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1253 (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|) |c_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_1253))) (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|) |c_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| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse6 v_ArrVal_1248))) (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 [2024-11-14 05:29:10,537 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1253 (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|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#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_1253))) (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|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#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| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|))) .cse6 v_ArrVal_1248))) (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 [2024-11-14 05:29:10,735 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_46| Int) (v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1261 (Array Int Int)) (v_ArrVal_1260 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_46|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_46| 1)) (not (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_46| v_ArrVal_1260))) (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_46| v_ArrVal_1261) |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 ((.cse0 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_46| (store v_ArrVal_1260 0 .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_46|))) .cse6 v_ArrVal_1253))) (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| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_46| (store v_ArrVal_1261 0 .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| 0))) .cse6 v_ArrVal_1248))) (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 [2024-11-14 05:29:10,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538485832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:29:10,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [303275885] [2024-11-14 05:29:10,741 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 05:29:10,741 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:29:10,742 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:29:10,742 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:29:10,742 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:29:11,391 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:29:11,399 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:29:22,343 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2682#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.offset_41| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_43| Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_43|) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~ptr~0#1.base_43|) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|)))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:29:22,344 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:29:22,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:29:22,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 41 [2024-11-14 05:29:22,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871256883] [2024-11-14 05:29:22,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:29:22,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-14 05:29:22,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:29:22,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-14 05:29:22,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=3708, Unknown=7, NotChecked=630, Total=4556 [2024-11-14 05:29:22,347 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 41 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 34 states have internal predecessors, (51), 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) [2024-11-14 05:29:28,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:29:28,809 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2024-11-14 05:29:28,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-14 05:29:28,810 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 34 states have internal predecessors, (51), 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 33 [2024-11-14 05:29:28,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:29:28,811 INFO L225 Difference]: With dead ends: 96 [2024-11-14 05:29:28,811 INFO L226 Difference]: Without dead ends: 93 [2024-11-14 05:29:28,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2337 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=492, Invalid=8077, Unknown=7, NotChecked=930, Total=9506 [2024-11-14 05:29:28,814 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 140 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:29:28,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 379 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-14 05:29:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-14 05:29:28,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2024-11-14 05:29:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-14 05:29:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2024-11-14 05:29:28,847 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 33 [2024-11-14 05:29:28,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:29:28,847 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2024-11-14 05:29:28,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 34 states have internal predecessors, (51), 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) [2024-11-14 05:29:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2024-11-14 05:29:28,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:29:28,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:29:28,849 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:29:28,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 05:29:29,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:29:29,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:29:29,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:29:29,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1477432355, now seen corresponding path program 3 times [2024-11-14 05:29:29,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:29:29,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781796766] [2024-11-14 05:29:29,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:29:29,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:29:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:29:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-14 05:29:29,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:29:29,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781796766] [2024-11-14 05:29:29,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781796766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:29:29,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899329354] [2024-11-14 05:29:29,202 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:29:29,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:29:29,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:29:29,205 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:29:29,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 05:29:30,402 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:29:30,403 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:29:30,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:29:30,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:29:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:29:30,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:29:30,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899329354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:29:30,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:29:30,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-14 05:29:30,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485916957] [2024-11-14 05:29:30,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:29:30,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:29:30,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:29:30,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:29:30,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:29:30,449 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2024-11-14 05:29:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:29:30,499 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2024-11-14 05:29:30,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:29:30,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 34 [2024-11-14 05:29:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:29:30,500 INFO L225 Difference]: With dead ends: 85 [2024-11-14 05:29:30,501 INFO L226 Difference]: Without dead ends: 31 [2024-11-14 05:29:30,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:29:30,502 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:29:30,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:29:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-14 05:29:30,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-14 05:29:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:29:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-14 05:29:30,519 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 34 [2024-11-14 05:29:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:29:30,519 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-14 05:29:30,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2024-11-14 05:29:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-14 05:29:30,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:29:30,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:29:30,524 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:29:30,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-14 05:29:30,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:29:30,725 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:29:30,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:29:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash -498173913, now seen corresponding path program 2 times [2024-11-14 05:29:30,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:29:30,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487706797] [2024-11-14 05:29:30,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:29:30,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:29:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:29:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:29:36,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:29:36,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487706797] [2024-11-14 05:29:36,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487706797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:29:36,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583848688] [2024-11-14 05:29:36,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:29:36,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:29:36,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:29:36,580 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:29:36,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 05:29:37,013 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:29:37,013 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:29:37,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 169 conjuncts are in the unsatisfiable core [2024-11-14 05:29:37,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:29:37,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:29:37,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:29:37,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:29:37,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:29:38,151 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:29:38,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:29:38,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:29:38,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:29:38,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:29:38,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:29:38,760 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-14 05:29:38,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 90 [2024-11-14 05:29:38,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-14 05:29:38,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:38,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-11-14 05:29:39,095 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:29:39,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 42 [2024-11-14 05:29:39,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:29:39,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:29:39,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:39,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 05:29:39,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:39,415 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 05:29:39,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 70 [2024-11-14 05:29:39,471 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 05:29:39,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-14 05:29:39,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-14 05:29:39,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:39,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:39,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 05:29:41,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:41,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:41,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:41,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:41,803 INFO L378 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 61 treesize of output 44 [2024-11-14 05:29:41,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:41,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:41,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:41,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2024-11-14 05:29:41,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:41,880 INFO L349 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2024-11-14 05:29:41,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 212 treesize of output 102 [2024-11-14 05:29:41,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:41,933 INFO L349 Elim1Store]: treesize reduction 72, result has 13.3 percent of original size [2024-11-14 05:29:41,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 103 treesize of output 90 [2024-11-14 05:29:41,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 108 [2024-11-14 05:29:41,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2024-11-14 05:29:41,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:41,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:41,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:41,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:41,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 48 [2024-11-14 05:29:43,110 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-14 05:29:43,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 58 [2024-11-14 05:29:43,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:43,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:43,126 INFO L378 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 05:29:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:29:43,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:29:46,091 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1591 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1589) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1590))) (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_1588)) (.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_1596))) (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_1591) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))) (not (= (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_1591 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) v_ArrVal_1591))))) is different from false [2024-11-14 05:29:50,751 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_51| Int) (v_ArrVal_1591 (Array Int Int)) (v_ArrVal_1590 (Array Int Int)) (v_ArrVal_1605 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_51| v_ArrVal_1605)) (.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_51| v_ArrVal_1604))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select .cse4 .cse5) .cse3)) (.cse0 (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_51| v_ArrVal_1589) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1590)) (.cse1 (select (select .cse6 .cse5) .cse3))) (or (not (= v_ArrVal_1591 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_1591 .cse2)))) (not (= .cse3 (select (select .cse4 .cse1) .cse2))) (not (= .cse5 (select (select .cse6 .cse1) .cse2))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_51| 1)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (store (let ((.cse14 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_51| (store v_ArrVal_1605 0 .cse3)))) (store .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0))) .cse1 v_ArrVal_1588)) (.cse7 (store (let ((.cse13 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_51| (store v_ArrVal_1604 0 .cse5)))) (store .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse13 |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_51|))) .cse1 v_ArrVal_1596))) (let ((.cse11 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select (select .cse7 .cse11) .cse12)) (.cse9 (select (select .cse10 .cse11) .cse12))) (select (select (store .cse0 .cse1 v_ArrVal_1591) (select (select .cse7 .cse8) .cse9)) (+ 4 (select (select .cse10 .cse8) .cse9))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_51|) 0))))))) is different from false [2024-11-14 05:29:50,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583848688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:29:50,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [418925683] [2024-11-14 05:29:50,760 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 05:29:50,760 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:29:50,760 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:29:50,761 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:29:50,761 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:29:51,436 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:29:51,444 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:30:01,872 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3465#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:30:01,873 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:30:01,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:30:01,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 51 [2024-11-14 05:30:01,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155866506] [2024-11-14 05:30:01,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:30:01,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-14 05:30:01,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:01,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-14 05:30:01,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5787, Unknown=4, NotChecked=306, Total=6320 [2024-11-14 05:30:01,876 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 51 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 05:30:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:09,684 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-11-14 05:30:09,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 05:30:09,685 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-11-14 05:30:09,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:09,685 INFO L225 Difference]: With dead ends: 37 [2024-11-14 05:30:09,685 INFO L226 Difference]: Without dead ends: 35 [2024-11-14 05:30:09,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=388, Invalid=8546, Unknown=4, NotChecked=374, Total=9312 [2024-11-14 05:30:09,687 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 46 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:09,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 180 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-14 05:30:09,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-14 05:30:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-14 05:30:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:30:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-14 05:30:09,699 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 34 [2024-11-14 05:30:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:09,699 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-14 05:30:09,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 05:30:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-14 05:30:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 05:30:09,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:09,700 INFO L215 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] [2024-11-14 05:30:09,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 05:30:09,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-14 05:30:09,900 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:30:09,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:09,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2003728739, now seen corresponding path program 2 times [2024-11-14 05:30:09,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:09,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247665921] [2024-11-14 05:30:09,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:09,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 05:30:10,193 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:10,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247665921] [2024-11-14 05:30:10,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247665921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:30:10,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793486016] [2024-11-14 05:30:10,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:30:10,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:30:10,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:30:10,196 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:30:10,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 05:30:10,906 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:30:10,906 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:30:10,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 05:30:10,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:30:11,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:30:11,144 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:30:11,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793486016] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:30:11,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [498331664] [2024-11-14 05:30:11,146 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 05:30:11,146 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:30:11,147 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:30:11,147 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:30:11,147 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:30:11,792 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:30:11,800 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:30:17,808 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3835#(and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.offset_57| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_59| Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_59|) |v_ULTIMATE.start_main_~ptr~0#1.offset_57|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~ptr~0#1.base_59|) |v_ULTIMATE.start_main_~ptr~0#1.offset_57|)))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:30:17,809 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:30:17,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:30:17,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2024-11-14 05:30:17,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075229755] [2024-11-14 05:30:17,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:30:17,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 05:30:17,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:17,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 05:30:17,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=816, Unknown=1, NotChecked=0, Total=930 [2024-11-14 05:30:17,811 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 05:30:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:17,965 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2024-11-14 05:30:17,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:30:17,966 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2024-11-14 05:30:17,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:17,966 INFO L225 Difference]: With dead ends: 43 [2024-11-14 05:30:17,966 INFO L226 Difference]: Without dead ends: 40 [2024-11-14 05:30:17,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=113, Invalid=816, Unknown=1, NotChecked=0, Total=930 [2024-11-14 05:30:17,968 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:17,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 140 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:30:17,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-14 05:30:17,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2024-11-14 05:30:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 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) [2024-11-14 05:30:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-14 05:30:17,986 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 36 [2024-11-14 05:30:17,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:17,986 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-14 05:30:17,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 05:30:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-14 05:30:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 05:30:17,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:17,987 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:30:18,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-14 05:30:18,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-14 05:30:18,188 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:30:18,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:18,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1986005590, now seen corresponding path program 3 times [2024-11-14 05:30:18,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:18,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553932402] [2024-11-14 05:30:18,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:18,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:30:22,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:22,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553932402] [2024-11-14 05:30:22,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553932402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:30:22,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668277468] [2024-11-14 05:30:22,753 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:30:22,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:30:22,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:30:22,755 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:30:22,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064cc784-f892-41fd-a908-494e6b6e13a1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 05:30:23,055 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:30:23,056 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:30:23,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 160 conjuncts are in the unsatisfiable core [2024-11-14 05:30:23,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:23,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:30:23,481 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:30:23,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:30:23,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:30:23,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:30:23,711 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-14 05:30:23,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 46 [2024-11-14 05:30:23,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-14 05:30:24,291 INFO L349 Elim1Store]: treesize reduction 58, result has 42.6 percent of original size [2024-11-14 05:30:24,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2024-11-14 05:30:24,378 INFO L349 Elim1Store]: treesize reduction 78, result has 22.8 percent of original size [2024-11-14 05:30:24,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 36 [2024-11-14 05:30:27,915 INFO L349 Elim1Store]: treesize reduction 571, result has 25.8 percent of original size [2024-11-14 05:30:27,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 22 case distinctions, treesize of input 1043 treesize of output 564 [2024-11-14 05:30:29,051 INFO L349 Elim1Store]: treesize reduction 808, result has 16.9 percent of original size [2024-11-14 05:30:29,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 45 case distinctions, treesize of input 569 treesize of output 395 [2024-11-14 05:34:33,022 WARN L286 SmtUtils]: Spent 3.79m on a formula simplification. DAG size of input: 5145 DAG size of output: 4499 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 05:34:33,025 INFO L349 Elim1Store]: treesize reduction 2304, result has 82.2 percent of original size [2024-11-14 05:34:33,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 51 select indices, 51 select index equivalence classes, 1 disjoint index pairs (out of 1275 index pairs), introduced 97 new quantified variables, introduced 1275 case distinctions, treesize of input 1535 treesize of output 11401 [2024-11-14 05:34:44,559 INFO L224 Elim1Store]: Index analysis took 4843 ms [2024-11-14 05:37:55,837 WARN L286 SmtUtils]: Spent 3.19m on a formula simplification. DAG size of input: 4228 DAG size of output: 3546 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 05:37:55,840 INFO L349 Elim1Store]: treesize reduction 2660, result has 75.4 percent of original size [2024-11-14 05:37:55,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 47 select indices, 47 select index equivalence classes, 0 disjoint index pairs (out of 1081 index pairs), introduced 54 new quantified variables, introduced 1081 case distinctions, treesize of input 8100 treesize of output 13285 [2024-11-14 05:38:10,985 WARN L286 SmtUtils]: Spent 15.12s on a formula simplification. DAG size of input: 5920 DAG size of output: 5908 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 05:38:34,807 WARN L286 SmtUtils]: Spent 15.10s on a formula simplification. DAG size of input: 5809 DAG size of output: 5809 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)