./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh --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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:27:08,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:27:08,917 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 15:27:08,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:27:08,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:27:08,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:27:08,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:27:08,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:27:08,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:27:08,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:27:08,946 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:27:08,947 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:27:08,947 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:27:08,948 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:27:08,948 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:27:08,949 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:27:08,949 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:27:08,950 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:27:08,950 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:27:08,951 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:27:08,951 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:27:08,952 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:27:08,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:27:08,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:27:08,954 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:27:08,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:27:08,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:27:08,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:27:08,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:27:08,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:27:08,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:27:08,956 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:27:08,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:27:08,957 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:27:08,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:27:08,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:27:08,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:27:08,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:27:08,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:27:08,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:27:08,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:27:08,959 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:27:08,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:27:08,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:27:08,959 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:27:08,960 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:27:08,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:27:08,960 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2023-12-02 15:27:09,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:27:09,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:27:09,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:27:09,208 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:27:09,209 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:27:09,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-12-02 15:27:11,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:27:12,180 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:27:12,180 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-12-02 15:27:12,195 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/data/4b50a1ba1/ffe6bf9d6e1f47089a5062368440a76c/FLAG40aa9bdd4 [2023-12-02 15:27:12,208 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/data/4b50a1ba1/ffe6bf9d6e1f47089a5062368440a76c [2023-12-02 15:27:12,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:27:12,212 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:27:12,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:27:12,214 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:27:12,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:27:12,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:27:12" (1/1) ... [2023-12-02 15:27:12,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e14d24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:12, skipping insertion in model container [2023-12-02 15:27:12,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:27:12" (1/1) ... [2023-12-02 15:27:12,264 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:27:12,506 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-12-02 15:27:12,509 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:27:12,519 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:27:12,562 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-12-02 15:27:12,563 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:27:12,587 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:27:12,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:12 WrapperNode [2023-12-02 15:27:12,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:27:12,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:27:12,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:27:12,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:27:12,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:12" (1/1) ... [2023-12-02 15:27:12,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:12" (1/1) ... [2023-12-02 15:27:12,631 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2023-12-02 15:27:12,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:27:12,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:27:12,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:27:12,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:27:12,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:12" (1/1) ... [2023-12-02 15:27:12,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:12" (1/1) ... [2023-12-02 15:27:12,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:12" (1/1) ... [2023-12-02 15:27:12,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:12" (1/1) ... [2023-12-02 15:27:12,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:12" (1/1) ... [2023-12-02 15:27:12,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:12" (1/1) ... [2023-12-02 15:27:12,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:12" (1/1) ... [2023-12-02 15:27:12,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:12" (1/1) ... [2023-12-02 15:27:12,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:27:12,665 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:27:12,665 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:27:12,665 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:27:12,666 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:12" (1/1) ... [2023-12-02 15:27:12,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:27:12,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:27:12,693 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:27:12,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:27:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 15:27:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 15:27:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 15:27:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 15:27:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 15:27:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:27:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 15:27:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 15:27:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 15:27:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:27:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 15:27:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:27:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:27:12,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:27:12,844 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:27:12,846 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:27:13,027 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:27:13,069 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:27:13,070 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 15:27:13,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:27:13 BoogieIcfgContainer [2023-12-02 15:27:13,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:27:13,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:27:13,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:27:13,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:27:13,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:27:12" (1/3) ... [2023-12-02 15:27:13,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b33c953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:27:13, skipping insertion in model container [2023-12-02 15:27:13,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:12" (2/3) ... [2023-12-02 15:27:13,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b33c953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:27:13, skipping insertion in model container [2023-12-02 15:27:13,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:27:13" (3/3) ... [2023-12-02 15:27:13,081 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2023-12-02 15:27:13,100 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:27:13,100 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 15:27:13,156 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:27:13,161 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@d456af7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:27:13,161 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 15:27:13,173 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) [2023-12-02 15:27:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 15:27:13,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:27:13,182 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:27:13,182 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:27:13,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:27:13,188 INFO L85 PathProgramCache]: Analyzing trace with hash 399683977, now seen corresponding path program 1 times [2023-12-02 15:27:13,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:27:13,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089822583] [2023-12-02 15:27:13,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:27:13,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:27:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:27:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 15:27:13,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:27:13,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089822583] [2023-12-02 15:27:13,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089822583] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:27:13,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:27:13,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:27:13,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132776473] [2023-12-02 15:27:13,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:27:13,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:27:13,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:27:13,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:27:13,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:27:13,583 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) [2023-12-02 15:27:13,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:27:13,628 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2023-12-02 15:27:13,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:27:13,630 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 [2023-12-02 15:27:13,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:27:13,637 INFO L225 Difference]: With dead ends: 53 [2023-12-02 15:27:13,637 INFO L226 Difference]: Without dead ends: 25 [2023-12-02 15:27:13,639 INFO L412 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 [2023-12-02 15:27:13,643 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:27:13,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:27:13,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-02 15:27:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-12-02 15:27:13,680 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) [2023-12-02 15:27:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-12-02 15:27:13,682 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 17 [2023-12-02 15:27:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:27:13,683 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-12-02 15:27:13,683 INFO L496 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) [2023-12-02 15:27:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-12-02 15:27:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 15:27:13,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:27:13,685 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:27:13,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 15:27:13,686 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:27:13,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:27:13,686 INFO L85 PathProgramCache]: Analyzing trace with hash -953160270, now seen corresponding path program 1 times [2023-12-02 15:27:13,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:27:13,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539587607] [2023-12-02 15:27:13,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:27:13,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:27:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:27:14,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:27:14,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:27:14,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539587607] [2023-12-02 15:27:14,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539587607] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:27:14,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005783128] [2023-12-02 15:27:14,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:27:14,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:27:14,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:27:14,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:27:14,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 15:27:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:27:14,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 15:27:14,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:27:14,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 15:27:14,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:27:14,694 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 [2023-12-02 15:27:14,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-02 15:27:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:27:14,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:27:14,852 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| Int) (v_ArrVal_172 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_172) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| 1)))) is different from false [2023-12-02 15:27:14,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005783128] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:27:14,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1299842826] [2023-12-02 15:27:14,873 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-12-02 15:27:14,873 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:27:14,875 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:27:14,881 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:27:14,881 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:27:16,544 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 15:27:16,554 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:27:26,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1299842826] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:27:26,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 15:27:26,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13, 13] total 34 [2023-12-02 15:27:26,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275876245] [2023-12-02 15:27:26,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:27:26,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 15:27:26,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:27:26,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 15:27:26,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1082, Unknown=8, NotChecked=66, Total=1260 [2023-12-02 15:27:26,133 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) [2023-12-02 15:27:28,726 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] [2023-12-02 15:27:31,236 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] [2023-12-02 15:27:34,085 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] [2023-12-02 15:27:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:27:34,467 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-12-02 15:27:34,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 15:27:34,468 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 [2023-12-02 15:27:34,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:27:34,469 INFO L225 Difference]: With dead ends: 28 [2023-12-02 15:27:34,469 INFO L226 Difference]: Without dead ends: 26 [2023-12-02 15:27:34,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=104, Invalid=1082, Unknown=8, NotChecked=66, Total=1260 [2023-12-02 15:27:34,471 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:27:34,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 4 Unknown, 0 Unchecked, 8.3s Time] [2023-12-02 15:27:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-02 15:27:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-02 15:27:34,478 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) [2023-12-02 15:27:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-12-02 15:27:34,479 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 23 [2023-12-02 15:27:34,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:27:34,480 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-12-02 15:27:34,480 INFO L496 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) [2023-12-02 15:27:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-12-02 15:27:34,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 15:27:34,481 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:27:34,481 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:27:34,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 15:27:34,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-02 15:27:34,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:27:34,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:27:34,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1157107414, now seen corresponding path program 1 times [2023-12-02 15:27:34,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:27:34,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151954444] [2023-12-02 15:27:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:27:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:27:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:27:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:27:35,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:27:35,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151954444] [2023-12-02 15:27:35,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151954444] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:27:35,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350980411] [2023-12-02 15:27:35,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:27:35,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:27:35,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:27:35,042 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:27:35,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 15:27:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:27:35,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 15:27:35,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:27:35,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 15:27:35,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:27:35,334 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 [2023-12-02 15:27:35,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-02 15:27:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:27:35,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:27:35,439 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_300 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| v_ArrVal_300) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| 1)))) is different from false [2023-12-02 15:27:35,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350980411] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:27:35,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [367856158] [2023-12-02 15:27:35,443 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-12-02 15:27:35,443 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:27:35,444 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:27:35,444 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:27:35,444 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:27:36,436 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 15:27:36,444 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:27:40,189 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#in~data#1| 1) (= 1 |c_ULTIMATE.start_sll_circular_append_~data#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.offset|) (<= 2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse2 (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_71| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_71| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4)))))) (.cse3 (exists ((|v_#length_28| (Array Int Int))) (= (store |v_#length_28| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8) |c_#length|))) (.cse4 (exists ((|v_#memory_int_39| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_#memory_int_39| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (and (= (store |v_#memory_int_82| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_82| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select .cse9 0))) |v_#memory_int_39|) (= (store |v_#memory_int_39| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store .cse9 4 1)) |c_#memory_int|))))) (.cse5 (exists ((|v_#valid_40| (Array Int Int))) (and (= (select |v_#valid_40| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_40| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1))))) (.cse6 (exists ((|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_65| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_65| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4)))))) (.cse7 (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0))) (.cse8 (<= (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|))) (or (and .cse0 .cse1 (exists ((|v_#memory_$Pointer$.base_74| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_42| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= 0 (select (select (store |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (store |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_85| |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|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_74| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= 0 (select (select (store |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |v_old(#memory_int)_AFTER_CALL_26| (store |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_85| |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)))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) .cse7 .cse8))) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 2 |c_ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true [2023-12-02 15:27:48,255 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '450#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_#memory_int_86| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10| Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_16| Int) (|v_#memory_int_15| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_69| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_15| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| (store (select |v_#memory_int_15| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)))) (= |v_#memory_int_15| (store |v_#memory_int_86| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_86| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 (select (select |v_#memory_int_15| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0)))) (= 0 (select (select |v_#memory_$Pointer$.base_75| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (= (store (store |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0))) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| (store (select (store |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0))) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| (store (select (store |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0 0))) (or (and (exists ((|v_#memory_int_39| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int)))) (and (= |v_#memory_int_39| (store |v_#memory_int_82| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_82| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 (select (select |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0)))) (= |v_#memory_int_86| (store |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4 1))))) (exists ((|v_#valid_40| (Array Int Int))) (and (= (select |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0) (= (store |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_71| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (store (select |v_#memory_$Pointer$.base_71| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4))) |v_#memory_$Pointer$.base_75|)) (exists ((|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (store (select |v_#memory_$Pointer$.offset_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4))) |v_#memory_$Pointer$.offset_69|)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0)) (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_74| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |v_old(#memory_int)_AFTER_CALL_26| (store |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_85| |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_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10|) (exists ((|v_#length_28| (Array Int Int))) (= |#length| (store |v_#length_28| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 8)))) (and (exists ((|v_#memory_int_39| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int)))) (and (= |v_#memory_int_39| (store |v_#memory_int_82| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_82| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 (select (select |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0)))) (= |v_#memory_int_86| (store |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4 1))))) (exists ((|v_#valid_40| (Array Int Int))) (and (= (select |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0) (= (store |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_71| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (store (select |v_#memory_$Pointer$.base_71| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4))) |v_#memory_$Pointer$.base_75|)) (exists ((|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (store (select |v_#memory_$Pointer$.offset_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4))) |v_#memory_$Pointer$.offset_69|)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0)) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_74| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_42| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (store |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_85| |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|) (= (select (select (store |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10|) (exists ((|v_#length_28| (Array Int Int))) (= |#length| (store |v_#length_28| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 8))))) (= (select (select |v_#memory_$Pointer$.offset_69| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (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 [2023-12-02 15:27:48,255 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:27:48,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 15:27:48,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-12-02 15:27:48,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665640211] [2023-12-02 15:27:48,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 15:27:48,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 15:27:48,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:27:48,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 15:27:48,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1156, Unknown=4, NotChecked=138, Total=1406 [2023-12-02 15:27:48,258 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 15:27:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:27:48,754 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2023-12-02 15:27:48,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 15:27:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2023-12-02 15:27:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:27:48,755 INFO L225 Difference]: With dead ends: 34 [2023-12-02 15:27:48,755 INFO L226 Difference]: Without dead ends: 25 [2023-12-02 15:27:48,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=157, Invalid=1569, Unknown=4, NotChecked=162, Total=1892 [2023-12-02 15:27:48,758 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:27:48,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 177 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:27:48,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-02 15:27:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-12-02 15:27:48,764 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) [2023-12-02 15:27:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-12-02 15:27:48,765 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 25 [2023-12-02 15:27:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:27:48,765 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-12-02 15:27:48,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 15:27:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-12-02 15:27:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 15:27:48,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:27:48,766 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:27:48,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 15:27:48,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-12-02 15:27:48,967 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:27:48,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:27:48,967 INFO L85 PathProgramCache]: Analyzing trace with hash 391020969, now seen corresponding path program 1 times [2023-12-02 15:27:48,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:27:48,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429145242] [2023-12-02 15:27:48,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:27:48,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:27:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:27:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:27:49,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:27:49,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429145242] [2023-12-02 15:27:49,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429145242] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:27:49,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394864162] [2023-12-02 15:27:49,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:27:49,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:27:49,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:27:49,881 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:27:49,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 15:27:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:27:50,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 92 conjunts are in the unsatisfiable core [2023-12-02 15:27:50,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:27:50,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:27:50,318 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 15:27:50,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 15:27:50,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:27:50,473 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-02 15:27:50,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2023-12-02 15:27:50,566 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:27:50,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2023-12-02 15:27:50,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 15:27:50,577 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 [2023-12-02 15:27:52,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:27:52,859 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 15:27:52,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 45 [2023-12-02 15:27:52,901 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 15:27:52,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 15:27:52,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:27:52,909 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 [2023-12-02 15:27:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:27:53,818 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:27:54,039 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_17| Int) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (or (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_17| v_ArrVal_441))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_17| v_ArrVal_442) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_17| 1)))) is different from false [2023-12-02 15:27:54,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394864162] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:27:54,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1054664765] [2023-12-02 15:27:54,043 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 15:27:54,043 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:27:54,043 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:27:54,043 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:27:54,043 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:27:55,006 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 15:27:55,014 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:28:15,162 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '695#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |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_~data~0#1| 1) (= |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_ULTIMATE.start_sll_circular_append_#in~head#1.base_12| Int) (|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| Int) (|v_#memory_$Pointer$.base_91| (Array Int (Array Int Int))) (|v_#memory_int_19| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_18| Int)) (and (or (not (= (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) 0)) (not (= (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) 0))) (= (store (store |v_#memory_$Pointer$.base_91| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.base_91| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select (store |v_#memory_$Pointer$.base_91| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.base_91| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 (select (select (store |v_#memory_$Pointer$.base_91| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.base_91| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_83| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.offset_83| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select (store |v_#memory_$Pointer$.offset_83| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.offset_83| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 (select (select (store |v_#memory_$Pointer$.offset_83| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.offset_83| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)))) (= |v_#memory_int_19| (store |v_#memory_int_105| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (store (select |v_#memory_int_105| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (select (select |v_#memory_int_19| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0))))) (or (and (exists ((|v_#memory_$Pointer$.base_87| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_87| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (store (select |v_#memory_$Pointer$.base_87| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 0) 4 (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 4))) |v_#memory_$Pointer$.base_91|)) (exists ((|v_#memory_int_39| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_39| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select |v_#memory_int_39| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 4 1)) |v_#memory_int_105|) (= |v_#memory_int_39| (store |v_#memory_int_101| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select |v_#memory_int_101| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 (select (select |v_#memory_int_39| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0)))))) (exists ((|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_83| (store |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (store (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 4))))) (not (= |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| 0)) (exists ((|v_#valid_51| (Array Int Int))) (and (= (store |v_#valid_51| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| 1) |#valid|) (= (select |v_#valid_51| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0))) (exists ((|v_old(#memory_int)_AFTER_CALL_38| (Array Int (Array Int Int))) (|v_#memory_int_104| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_82| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= |v_old(#memory_int)_AFTER_CALL_38| (store |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_38| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|))) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_12| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_35| (Array Int Int))) (= |#length| (store |v_#length_35| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| 8))) (<= (+ |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_18| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_12|)) (and (exists ((|v_#memory_$Pointer$.base_87| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_87| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (store (select |v_#memory_$Pointer$.base_87| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 0) 4 (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 4))) |v_#memory_$Pointer$.base_91|)) (exists ((|v_#memory_int_39| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_39| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select |v_#memory_int_39| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 4 1)) |v_#memory_int_105|) (= |v_#memory_int_39| (store |v_#memory_int_101| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select |v_#memory_int_101| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 (select (select |v_#memory_int_39| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0)))))) (exists ((|v_#memory_int_104| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_39| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_82| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= (select (select (store |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_39| (store |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_39| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0)))) (= (select (select (store |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|))) (exists ((|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_83| (store |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (store (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 4))))) (not (= |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| 0)) (exists ((|v_#valid_51| (Array Int Int))) (and (= (store |v_#valid_51| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| 1) |#valid|) (= (select |v_#valid_51| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0))) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_12| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_35| (Array Int Int))) (= |#length| (store |v_#length_35| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| 8))) (<= (+ |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_18| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_12|))) (= (select (select |v_#memory_$Pointer$.base_91| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (= |#memory_int| (store |v_#memory_int_19| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select |v_#memory_int_19| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0)))) (= (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (select (select |v_#memory_$Pointer$.offset_83| (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0))))))' at error location [2023-12-02 15:28:15,162 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:28:15,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 15:28:15,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 32 [2023-12-02 15:28:15,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066702278] [2023-12-02 15:28:15,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 15:28:15,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-02 15:28:15,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:28:15,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-02 15:28:15,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2572, Unknown=16, NotChecked=102, Total=2862 [2023-12-02 15:28:15,165 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 32 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 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) [2023-12-02 15:28:18,004 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] [2023-12-02 15:28:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:28:18,856 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2023-12-02 15:28:18,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 15:28:18,857 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 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 26 [2023-12-02 15:28:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:28:18,857 INFO L225 Difference]: With dead ends: 44 [2023-12-02 15:28:18,857 INFO L226 Difference]: Without dead ends: 36 [2023-12-02 15:28:18,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=237, Invalid=3172, Unknown=17, NotChecked=114, Total=3540 [2023-12-02 15:28:18,860 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 52 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:28:18,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 223 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 469 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2023-12-02 15:28:18,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-02 15:28:18,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2023-12-02 15:28:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 15:28:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-12-02 15:28:18,870 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 26 [2023-12-02 15:28:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:28:18,871 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-12-02 15:28:18,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 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) [2023-12-02 15:28:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2023-12-02 15:28:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 15:28:18,872 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:28:18,872 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:28:18,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 15:28:19,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-02 15:28:19,073 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:28:19,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:28:19,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1667229732, now seen corresponding path program 1 times [2023-12-02 15:28:19,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:28:19,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525637738] [2023-12-02 15:28:19,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:28:19,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:28:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:28:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:28:21,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:28:21,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525637738] [2023-12-02 15:28:21,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525637738] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:28:21,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733855675] [2023-12-02 15:28:21,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:28:21,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:28:21,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:28:21,442 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:28:21,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 15:28:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:28:21,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 135 conjunts are in the unsatisfiable core [2023-12-02 15:28:21,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:28:21,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:28:21,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 15:28:21,905 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 15:28:21,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 15:28:22,132 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 [2023-12-02 15:28:22,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:28:22,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:28:22,373 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 15:28:22,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-12-02 15:28:22,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:28:22,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:28:22,745 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-02 15:28:22,746 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 90 treesize of output 59 [2023-12-02 15:28:22,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2023-12-02 15:28:22,938 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:28:22,938 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 71 treesize of output 34 [2023-12-02 15:28:22,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 15:28:22,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:28:22,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-12-02 15:28:22,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 15:28:23,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:28:23,152 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 15:28:23,153 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 79 treesize of output 60 [2023-12-02 15:28:23,188 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-02 15:28:23,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-02 15:28:23,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:28:23,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:28:23,245 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 15:28:23,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-12-02 15:28:23,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:28:23,285 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 [2023-12-02 15:28:24,364 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2023-12-02 15:28:24,364 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 5 case distinctions, treesize of input 181 treesize of output 96 [2023-12-02 15:28:24,415 INFO L349 Elim1Store]: treesize reduction 78, result has 17.0 percent of original size [2023-12-02 15:28:24,415 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 251 treesize of output 138 [2023-12-02 15:28:24,430 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 64 treesize of output 58 [2023-12-02 15:28:24,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:28:24,440 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 40 treesize of output 11 [2023-12-02 15:28:24,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 15 [2023-12-02 15:28:24,640 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-12-02 15:28:24,640 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 117 treesize of output 43 [2023-12-02 15:28:24,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 15:28:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:28:24,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:28:24,917 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_583) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_585) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_586)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-12-02 15:28:26,134 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 Int) (v_ArrVal_581 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_21| Int) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| Int) (v_ArrVal_598 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_598))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_596))) (let ((.cse0 (select (select .cse4 .cse3) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (select .cse4 .cse0))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_583) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_585) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_21| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_581) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select .cse2 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_21| v_ArrVal_586)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_587) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse3 (select .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_21|))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29|) 0)))))))) is different from false [2023-12-02 15:28:26,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733855675] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:28:26,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [753000112] [2023-12-02 15:28:26,139 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 15:28:26,139 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:28:26,139 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:28:26,139 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:28:26,140 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:28:26,964 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 15:28:26,972 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:28:32,893 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '996#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |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_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_21| Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_20| Int) (|v_#memory_$Pointer$.offset_98| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_108| (Array Int (Array Int Int))) (|v_#memory_int_134| (Array Int (Array Int Int))) (|v_#memory_int_19| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25| Int)) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_98| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25| (store (select |v_#memory_$Pointer$.offset_98| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25| 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_21| (store (select (store |v_#memory_$Pointer$.offset_98| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25| (store (select |v_#memory_$Pointer$.offset_98| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25| 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_21|) 0 (select (select (store |v_#memory_$Pointer$.offset_98| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25| (store (select |v_#memory_$Pointer$.offset_98| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25| 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_20|) 0)))) (= (select (select |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_sll_circular_append_~head#1.base_20|) 0) (select (select |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25|)) (= (select (select |v_#memory_$Pointer$.offset_98| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25|) (select (select |v_#memory_$Pointer$.offset_98| |v_ULTIMATE.start_sll_circular_append_~head#1.base_20|) 0)) (= |#memory_int| (store |v_#memory_int_19| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_21| (store (select |v_#memory_int_19| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_21|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_21|) 0)))) (<= 2 |v_ULTIMATE.start_sll_circular_append_~head#1.base_20|) (= |v_#memory_int_19| (store |v_#memory_int_134| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25| (store (select |v_#memory_int_134| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25| (select (select |v_#memory_int_19| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25|)))) (= (store (store |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25| (store (select |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_21|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_21| (store (select (store |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25| (store (select |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_21|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_21|) 0 (select (select (store |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25| (store (select |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_25| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_21|)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_20|) 0))) |#memory_$Pointer$.base|))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |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 [2023-12-02 15:28:32,893 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:28:32,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 15:28:32,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 42 [2023-12-02 15:28:32,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770982947] [2023-12-02 15:28:32,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 15:28:32,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-02 15:28:32,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:28:32,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-02 15:28:32,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=4318, Unknown=17, NotChecked=266, Total=4830 [2023-12-02 15:28:32,896 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 43 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:28:35,552 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] [2023-12-02 15:28:37,711 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] [2023-12-02 15:28:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:28:39,442 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2023-12-02 15:28:39,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 15:28:39,442 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 2 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 28 [2023-12-02 15:28:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:28:39,443 INFO L225 Difference]: With dead ends: 50 [2023-12-02 15:28:39,443 INFO L226 Difference]: Without dead ends: 48 [2023-12-02 15:28:39,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1583 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=369, Invalid=6101, Unknown=18, NotChecked=318, Total=6806 [2023-12-02 15:28:39,446 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 60 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 23 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:28:39,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 201 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 680 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2023-12-02 15:28:39,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-02 15:28:39,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2023-12-02 15:28:39,457 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) [2023-12-02 15:28:39,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2023-12-02 15:28:39,458 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 28 [2023-12-02 15:28:39,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:28:39,459 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2023-12-02 15:28:39,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:28:39,459 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2023-12-02 15:28:39,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 15:28:39,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:28:39,460 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:28:39,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 15:28:39,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:28:39,661 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:28:39,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:28:39,661 INFO L85 PathProgramCache]: Analyzing trace with hash 186849052, now seen corresponding path program 1 times [2023-12-02 15:28:39,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:28:39,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940344296] [2023-12-02 15:28:39,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:28:39,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:28:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:28:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 15:28:41,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:28:41,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940344296] [2023-12-02 15:28:41,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940344296] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:28:41,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013884228] [2023-12-02 15:28:41,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:28:41,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:28:41,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:28:41,180 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:28:41,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 15:28:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:28:41,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 101 conjunts are in the unsatisfiable core [2023-12-02 15:28:41,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:28:41,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:28:41,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 15:28:41,531 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 15:28:41,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 15:28:41,693 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 [2023-12-02 15:28:41,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:28:41,843 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 15:28:41,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-12-02 15:28:41,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:28:42,110 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-12-02 15:28:42,111 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 86 treesize of output 67 [2023-12-02 15:28:42,225 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-02 15:28:42,226 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 27 [2023-12-02 15:28:42,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:28:42,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-12-02 15:28:42,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:28:42,367 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 15:28:42,368 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 63 [2023-12-02 15:28:42,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:28:42,379 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 62 treesize of output 53 [2023-12-02 15:28:42,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:28:42,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:28:42,416 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-12-02 15:28:42,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2023-12-02 15:28:42,996 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2023-12-02 15:28:42,997 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 77 [2023-12-02 15:28:43,035 INFO L349 Elim1Store]: treesize reduction 78, result has 17.0 percent of original size [2023-12-02 15:28:43,036 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 235 treesize of output 132 [2023-12-02 15:28:43,051 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 15:28:43,051 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 147 [2023-12-02 15:28:43,066 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2023-12-02 15:28:43,066 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 154 treesize of output 145 [2023-12-02 15:28:43,198 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 121 treesize of output 93 [2023-12-02 15:28:43,361 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-12-02 15:28:43,361 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 117 treesize of output 39 [2023-12-02 15:28:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:28:43,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:28:43,387 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_736 Int) (v_ArrVal_731 (Array Int Int))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_733))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_736)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-12-02 15:28:43,407 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_29| Int) (v_ArrVal_736 Int) (v_ArrVal_731 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_29| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_733))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_29| v_ArrVal_736)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-12-02 15:28:43,425 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_29| Int) (v_ArrVal_736 Int) (v_ArrVal_731 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_29| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_733))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_29| v_ArrVal_736)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2023-12-02 15:28:43,437 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_29| Int) (v_ArrVal_736 Int) (v_ArrVal_731 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_29| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_733))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_29| v_ArrVal_736)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2023-12-02 15:28:43,540 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_29| Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_34| Int) (v_ArrVal_736 Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (or (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_34| v_ArrVal_742)) (.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_34| v_ArrVal_741))) (let ((.cse2 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select .cse4 .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_29| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_34|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_34| v_ArrVal_733))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select .cse3 .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_29| v_ArrVal_736)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_34| v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_34| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_34|) 0)))) is different from false [2023-12-02 15:28:43,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013884228] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:28:43,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [481758891] [2023-12-02 15:28:43,545 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 15:28:43,545 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:28:43,546 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:28:43,546 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:28:43,546 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:28:44,316 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 15:28:44,323 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:28:50,056 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1330#(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) (= |ULTIMATE.start_main_~count~0#1| 1) (= (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_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_24| Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_22| Int) (|v_#memory_$Pointer$.base_125| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33| Int) (|v_#memory_int_19| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_113| (Array Int (Array Int Int))) (|v_#memory_int_153| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_113| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33| (store (select |v_#memory_$Pointer$.offset_113| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_24| (store (select (store |v_#memory_$Pointer$.offset_113| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33| (store (select |v_#memory_$Pointer$.offset_113| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_24|) 0 (select (select (store |v_#memory_$Pointer$.offset_113| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33| (store (select |v_#memory_$Pointer$.offset_113| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_22|) 0)))) (= (select (select |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33|) (select (select |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_sll_circular_append_~head#1.base_22|) 0)) (<= 2 |v_ULTIMATE.start_sll_circular_append_~head#1.base_22|) (= (store (store |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33| (store (select |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_24|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_24| (store (select (store |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33| (store (select |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_24|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_24|) 0 (select (select (store |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33| (store (select |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_24|)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_22|) 0))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_19| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_24| (store (select |v_#memory_int_19| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_24|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_24|) 0)))) (= (store |v_#memory_int_153| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33| (store (select |v_#memory_int_153| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| (select (select |v_#memory_int_19| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33|))) |v_#memory_int_19|) (= (select (select |v_#memory_$Pointer$.offset_113| |v_ULTIMATE.start_sll_circular_append_~head#1.base_22|) 0) (select (select |v_#memory_$Pointer$.offset_113| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_33|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~ptr~0#1.base| (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))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (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 [2023-12-02 15:28:50,056 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:28:50,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 15:28:50,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 37 [2023-12-02 15:28:50,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111049582] [2023-12-02 15:28:50,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 15:28:50,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 15:28:50,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:28:50,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 15:28:50,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3016, Unknown=20, NotChecked=570, Total=3782 [2023-12-02 15:28:50,059 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 38 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:28:52,447 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] [2023-12-02 15:28:54,555 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] [2023-12-02 15:28:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:28:57,015 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2023-12-02 15:28:57,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-02 15:28:57,016 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 6 states have call successors, (6), 2 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 30 [2023-12-02 15:28:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:28:57,017 INFO L225 Difference]: With dead ends: 79 [2023-12-02 15:28:57,017 INFO L226 Difference]: Without dead ends: 76 [2023-12-02 15:28:57,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=374, Invalid=5474, Unknown=24, NotChecked=770, Total=6642 [2023-12-02 15:28:57,021 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 160 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:28:57,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 366 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 656 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2023-12-02 15:28:57,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-12-02 15:28:57,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2023-12-02 15:28:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 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) [2023-12-02 15:28:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2023-12-02 15:28:57,037 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 30 [2023-12-02 15:28:57,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:28:57,037 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2023-12-02 15:28:57,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:28:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2023-12-02 15:28:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 15:28:57,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:28:57,039 INFO L195 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] [2023-12-02 15:28:57,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 15:28:57,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-02 15:28:57,240 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:28:57,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:28:57,240 INFO L85 PathProgramCache]: Analyzing trace with hash -256795681, now seen corresponding path program 2 times [2023-12-02 15:28:57,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:28:57,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216850737] [2023-12-02 15:28:57,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:28:57,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:28:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:28:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:28:58,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:28:58,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216850737] [2023-12-02 15:28:58,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216850737] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:28:58,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029514028] [2023-12-02 15:28:58,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:28:58,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:28:58,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:28:58,341 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:28:58,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 15:28:58,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 15:28:58,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:28:58,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 163 conjunts are in the unsatisfiable core [2023-12-02 15:28:58,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:28:58,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:28:58,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 15:28:58,935 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 15:28:58,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 15:28:59,133 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:28:59,133 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 7 [2023-12-02 15:28:59,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:28:59,305 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-12-02 15:28:59,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-12-02 15:28:59,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:28:59,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:28:59,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:28:59,641 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-02 15:28:59,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 68 [2023-12-02 15:28:59,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2023-12-02 15:28:59,665 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 39 treesize of output 30 [2023-12-02 15:28:59,799 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:28:59,799 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 76 treesize of output 43 [2023-12-02 15:28:59,810 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:28:59,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 15:28:59,820 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:28:59,820 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 1 case distinctions, treesize of input 16 treesize of output 10 [2023-12-02 15:28:59,967 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 9 treesize of output 12 [2023-12-02 15:29:00,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:29:00,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 15:29:00,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:29:00,106 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 15:29:00,107 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 84 treesize of output 65 [2023-12-02 15:29:00,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:29:00,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:29:00,141 INFO L349 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2023-12-02 15:29:00,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2023-12-02 15:29:00,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:29:00,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:29:00,162 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-02 15:29:00,162 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 1 case distinctions, treesize of input 42 treesize of output 43 [2023-12-02 15:29:01,244 INFO L349 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2023-12-02 15:29:01,244 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 3 case distinctions, treesize of input 90 treesize of output 78 [2023-12-02 15:29:01,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 25 [2023-12-02 15:29:01,299 INFO L349 Elim1Store]: treesize reduction 70, result has 18.6 percent of original size [2023-12-02 15:29:01,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 102 [2023-12-02 15:29:01,346 INFO L349 Elim1Store]: treesize reduction 56, result has 28.2 percent of original size [2023-12-02 15:29:01,346 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 54 [2023-12-02 15:29:01,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:29:01,363 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-12-02 15:29:01,364 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 4 case distinctions, treesize of input 45 treesize of output 41 [2023-12-02 15:29:01,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:29:01,589 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 15:29:01,589 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 82 treesize of output 63 [2023-12-02 15:29:01,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-02 15:29:01,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:29:01,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:29:01,619 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-02 15:29:01,620 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 1 case distinctions, treesize of input 42 treesize of output 43 [2023-12-02 15:29:02,063 INFO L349 Elim1Store]: treesize reduction 4, result has 91.8 percent of original size [2023-12-02 15:29:02,064 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 376 treesize of output 251 [2023-12-02 15:29:02,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:29:02,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 208 treesize of output 324 [2023-12-02 15:38:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:38:48,719 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:38:52,200 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_38| Int) (v_ArrVal_887 (Array Int Int)) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_890 Int) (v_ArrVal_889 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_38| (store (select |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_38|) .cse1 v_ArrVal_889)))) (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_890))) (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_38| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_38|) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_887) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_38| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_38|) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-12-02 15:38:54,357 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_38| Int) (v_ArrVal_887 (Array Int Int)) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_890 Int) (v_ArrVal_889 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (select (select (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_38| (store (select |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_38|) .cse1 v_ArrVal_889)))) (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_890))) (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_38| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_38|) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_887) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_38| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_38|) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-12-02 15:38:58,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:38:58,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 283 treesize of output 281 [2023-12-02 15:38:59,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029514028] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:38:59,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [24971750] [2023-12-02 15:38:59,477 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 15:38:59,477 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:38:59,477 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:38:59,478 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:38:59,478 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:39:00,178 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 15:39:00,185 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:39:01,335 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (let ((.cse0 (exists ((|v_#memory_int_39| (Array Int (Array Int Int))) (|v_#memory_int_178| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_int_39| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|))) (and (= |c_#memory_int| (store |v_#memory_int_39| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store .cse12 4 1))) (= |v_#memory_int_39| (store |v_#memory_int_178| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (select |v_#memory_int_178| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 (select .cse12 0)))))))) (.cse1 (exists ((|v_#length_56| (Array Int Int))) (= (store |v_#length_56| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 8) |c_#length|))) (.cse2 (<= (+ |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 1) |c_#StackHeapBarrier|)) (.cse3 (exists ((|v_#valid_86| (Array Int Int))) (and (= (select |v_#valid_86| 2) 1) (= (select |v_#valid_86| 0) 0) (= (select |v_#valid_86| 1) 1) (= (select |v_#valid_86| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (.cse4 (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 0))) (.cse5 (exists ((|v_#length_55| (Array Int Int))) (and (= 2 (select |v_#length_55| 1)) (= (select |v_#length_55| 2) 21)))) (.cse6 (exists ((|v_#memory_$Pointer$.base_138| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (store (select |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 4)))))) (.cse7 (exists ((|v_#valid_87| (Array Int Int))) (and (= (select |v_#valid_87| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (store |v_#valid_87| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 1))))) (.cse9 (exists ((|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_126| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (store (select |v_#memory_$Pointer$.offset_126| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 4)))))) (.cse10 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_#memory_int_BEFORE_CALL_123| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_#memory_int_BEFORE_CALL_123| 1))) (and (= (select .cse8 1) 0) (= 48 (select .cse8 0))))) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_#memory_int_BEFORE_CALL_121| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_#memory_int_BEFORE_CALL_121| 1))) (and (= (select .cse11 1) 0) (= (select .cse11 0) 48)))) .cse9 .cse10))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 2 |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (= |c_ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~len#1| 2) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true [2023-12-02 15:39:06,008 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1744#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_24| Int) (|v_#memory_int_182| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_27| Int) (|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_43| Int) (|v_#memory_int_19| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_142| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_circular_append_~head#1.base_24|) 0) (select (select |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_43|)) (= |v_#memory_int_19| (store |v_#memory_int_182| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43| (store (select |v_#memory_int_182| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_43| (select (select |v_#memory_int_19| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_43|)))) (= |#memory_int| (store |v_#memory_int_19| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_27| (store (select |v_#memory_int_19| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_27|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_27|) 0)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43| (store (select |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_43| 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_27| (store (select (store |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43| (store (select |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_43| 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_27|) 0 (select (select (store |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43| (store (select |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_43| 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_24|) 0)))) (= (select (select |v_#memory_$Pointer$.base_142| |v_ULTIMATE.start_sll_circular_append_~head#1.base_24|) 0) (select (select |v_#memory_$Pointer$.base_142| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_43|)) (= (store (store |v_#memory_$Pointer$.base_142| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43| (store (select |v_#memory_$Pointer$.base_142| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_43| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_27|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_27| (store (select (store |v_#memory_$Pointer$.base_142| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43| (store (select |v_#memory_$Pointer$.base_142| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_43| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_27|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_27|) 0 (select (select (store |v_#memory_$Pointer$.base_142| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43| (store (select |v_#memory_$Pointer$.base_142| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_43|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_43| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_27|)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_24|) 0))) |#memory_$Pointer$.base|) (<= 2 |v_ULTIMATE.start_sll_circular_append_~head#1.base_24|))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |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_~data~0#1| 1) (= |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 [2023-12-02 15:39:06,008 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:39:06,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 15:39:06,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2023-12-02 15:39:06,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532800744] [2023-12-02 15:39:06,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 15:39:06,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 15:39:06,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:39:06,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 15:39:06,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=3911, Unknown=49, NotChecked=384, Total=4556 [2023-12-02 15:39:06,011 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 41 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:39:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:39:09,645 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2023-12-02 15:39:09,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 15:39:09,646 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 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 30 [2023-12-02 15:39:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:39:09,647 INFO L225 Difference]: With dead ends: 69 [2023-12-02 15:39:09,647 INFO L226 Difference]: Without dead ends: 59 [2023-12-02 15:39:09,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1603 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=361, Invalid=5608, Unknown=49, NotChecked=462, Total=6480 [2023-12-02 15:39:09,649 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:39:09,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 190 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 15:39:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-02 15:39:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2023-12-02 15:39:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 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) [2023-12-02 15:39:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2023-12-02 15:39:09,663 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 30 [2023-12-02 15:39:09,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:39:09,663 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2023-12-02 15:39:09,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:39:09,663 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2023-12-02 15:39:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 15:39:09,664 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:39:09,664 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:39:09,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 15:39:09,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 15:39:09,865 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:39:09,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:39:09,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1497394481, now seen corresponding path program 1 times [2023-12-02 15:39:09,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:39:09,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984875362] [2023-12-02 15:39:09,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:39:09,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:39:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:39:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:39:13,646 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:39:13,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984875362] [2023-12-02 15:39:13,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984875362] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:39:13,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802483975] [2023-12-02 15:39:13,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:39:13,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:39:13,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:39:13,647 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:39:13,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 15:39:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:39:13,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 157 conjunts are in the unsatisfiable core [2023-12-02 15:39:13,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:39:14,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:39:14,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:39:14,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 15:39:14,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 15:39:14,843 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:39:14,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 15:39:14,907 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 15:39:14,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 15:39:15,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:39:15,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:39:15,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:39:15,363 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-02 15:39:15,363 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 [2023-12-02 15:39:15,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2023-12-02 15:39:15,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:15,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2023-12-02 15:39:15,583 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:39:15,583 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 [2023-12-02 15:39:15,591 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 [2023-12-02 15:39:15,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 15:39:15,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:15,606 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 [2023-12-02 15:39:15,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:15,837 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 15:39:15,837 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 [2023-12-02 15:39:15,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:15,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:15,870 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-02 15:39:15,870 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 33 [2023-12-02 15:39:15,916 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 15:39:15,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 15:39:15,931 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 [2023-12-02 15:39:17,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:17,242 INFO L349 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2023-12-02 15:39:17,242 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 4 case distinctions, treesize of input 213 treesize of output 130 [2023-12-02 15:39:17,255 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 83 treesize of output 34 [2023-12-02 15:39:17,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:17,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:17,265 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2023-12-02 15:39:17,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:17,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:17,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:17,277 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2023-12-02 15:39:17,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2023-12-02 15:39:17,719 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:39:17,720 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 91 treesize of output 42 [2023-12-02 15:39:17,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:17,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:17,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 15:39:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:39:17,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:39:18,262 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int))) (or (not (= v_ArrVal_1048 (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_1048 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1047)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1049) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1045))) (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 |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1048) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1046) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))))) is different from false [2023-12-02 15:39:18,305 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (not (= (store (select |c_#memory_int| .cse0) .cse1 (select v_ArrVal_1048 .cse1)) v_ArrVal_1048)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1047)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1049) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1045))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1048) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1046) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4)))))))) is different from false [2023-12-02 15:39:18,341 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse1 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7))) (or (not (= (store (select |c_#memory_int| .cse0) .cse1 (select v_ArrVal_1048 .cse1)) v_ArrVal_1048)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1047)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1049) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1045))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1048) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1046) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4))))))))) is different from false [2023-12-02 15:39:18,366 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse1 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7))) (or (not (= (store (select |c_#memory_int| .cse0) .cse1 (select v_ArrVal_1048 .cse1)) v_ArrVal_1048)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1047)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1049) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1045))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1048) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1046) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4))))))))) is different from false [2023-12-02 15:39:18,597 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1048 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| Int) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1061 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_1059)) (.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_1061))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select .cse9 .cse7) .cse8)) (.cse1 (select (select .cse6 .cse7) .cse8))) (or (not (= (store (select (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_1060) .cse0) .cse1 (select v_ArrVal_1048 .cse1)) v_ArrVal_1048)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select .cse6 .cse0) .cse1 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_1047)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1049) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_1045))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1048) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_1046) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| 1))))))) is different from false [2023-12-02 15:39:18,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802483975] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:39:18,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [127076163] [2023-12-02 15:39:18,602 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-12-02 15:39:18,602 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:39:18,603 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:39:18,603 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:39:18,603 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:39:19,292 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 15:39:19,299 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:39:25,431 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2142#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |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)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 15:39:25,431 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:39:25,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 15:39:25,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 47 [2023-12-02 15:39:25,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992365445] [2023-12-02 15:39:25,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 15:39:25,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-02 15:39:25,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:39:25,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-02 15:39:25,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=4489, Unknown=14, NotChecked=690, Total=5402 [2023-12-02 15:39:25,436 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 47 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:39:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:39:29,532 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2023-12-02 15:39:29,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 15:39:29,533 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 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 31 [2023-12-02 15:39:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:39:29,534 INFO L225 Difference]: With dead ends: 63 [2023-12-02 15:39:29,534 INFO L226 Difference]: Without dead ends: 61 [2023-12-02 15:39:29,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=347, Invalid=6630, Unknown=15, NotChecked=840, Total=7832 [2023-12-02 15:39:29,536 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:39:29,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 230 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 15:39:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-02 15:39:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2023-12-02 15:39:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 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) [2023-12-02 15:39:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2023-12-02 15:39:29,551 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 31 [2023-12-02 15:39:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:39:29,551 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2023-12-02 15:39:29,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:39:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2023-12-02 15:39:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 15:39:29,552 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:39:29,552 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:39:29,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 15:39:29,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:39:29,753 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:39:29,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:39:29,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1227365472, now seen corresponding path program 2 times [2023-12-02 15:39:29,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:39:29,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159104392] [2023-12-02 15:39:29,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:39:29,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:39:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:39:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-02 15:39:29,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:39:29,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159104392] [2023-12-02 15:39:29,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159104392] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:39:29,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181247504] [2023-12-02 15:39:29,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:39:29,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:39:29,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:39:29,823 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:39:29,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 15:39:30,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 15:39:30,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:39:30,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 15:39:30,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:39:30,147 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:39:30,147 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:39:30,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181247504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:39:30,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:39:30,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-12-02 15:39:30,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762845563] [2023-12-02 15:39:30,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:39:30,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:39:30,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:39:30,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:39:30,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:39:30,149 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 15:39:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:39:30,191 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2023-12-02 15:39:30,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:39:30,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 32 [2023-12-02 15:39:30,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:39:30,193 INFO L225 Difference]: With dead ends: 64 [2023-12-02 15:39:30,193 INFO L226 Difference]: Without dead ends: 30 [2023-12-02 15:39:30,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:39:30,194 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:39:30,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:39:30,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-02 15:39:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-02 15:39:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:39:30,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-12-02 15:39:30,207 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 32 [2023-12-02 15:39:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:39:30,207 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-12-02 15:39:30,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 15:39:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-12-02 15:39:30,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 15:39:30,209 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:39:30,209 INFO L195 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] [2023-12-02 15:39:30,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 15:39:30,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-02 15:39:30,409 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:39:30,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:39:30,410 INFO L85 PathProgramCache]: Analyzing trace with hash 183930089, now seen corresponding path program 1 times [2023-12-02 15:39:30,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:39:30,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190157560] [2023-12-02 15:39:30,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:39:30,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:39:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:39:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 15:39:33,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:39:33,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190157560] [2023-12-02 15:39:33,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190157560] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:39:33,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551002792] [2023-12-02 15:39:33,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:39:33,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:39:33,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:39:33,082 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:39:33,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2befdc0d-c2cb-4a15-a903-1d70fae35d68/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 15:39:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:39:33,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 133 conjunts are in the unsatisfiable core [2023-12-02 15:39:33,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:39:33,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:39:33,991 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 15:39:33,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 15:39:34,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:39:34,289 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-02 15:39:34,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2023-12-02 15:39:34,437 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:39:34,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2023-12-02 15:39:34,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 15:39:34,446 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 [2023-12-02 15:39:34,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:34,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:39:34,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:34,626 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 15:39:34,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 45 [2023-12-02 15:39:34,659 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 15:39:34,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 15:39:35,651 INFO L349 Elim1Store]: treesize reduction 271, result has 20.1 percent of original size [2023-12-02 15:39:35,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 671 treesize of output 301 [2023-12-02 15:39:35,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:35,769 INFO L349 Elim1Store]: treesize reduction 279, result has 16.7 percent of original size [2023-12-02 15:39:35,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 733 treesize of output 497 [2023-12-02 15:39:36,466 INFO L349 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2023-12-02 15:39:36,467 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 4 case distinctions, treesize of input 254 treesize of output 204 [2023-12-02 15:39:36,474 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 162 treesize of output 136 [2023-12-02 15:39:36,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2023-12-02 15:39:36,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:36,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:36,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:36,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 21 [2023-12-02 15:39:40,189 INFO L349 Elim1Store]: treesize reduction 108, result has 87.5 percent of original size [2023-12-02 15:39:40,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 14 new quantified variables, introduced 45 case distinctions, treesize of input 1423 treesize of output 1855 [2023-12-02 15:39:40,261 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 591 treesize of output 589 [2023-12-02 15:39:40,287 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 589 treesize of output 587 [2023-12-02 15:39:40,315 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 587 treesize of output 585 [2023-12-02 15:39:40,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:39:40,372 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 585 treesize of output 590