./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/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_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/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_e3970246-4732-41b3-8033-df08ab8c206e/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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:40:05,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:40:05,268 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 13:40:05,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:40:05,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:40:05,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:40:05,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:40:05,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:40:05,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:40:05,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:40:05,301 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:40:05,302 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:40:05,302 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:40:05,302 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 13:40:05,303 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:40:05,303 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:40:05,304 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 13:40:05,304 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 13:40:05,305 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:40:05,305 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 13:40:05,306 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 13:40:05,306 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 13:40:05,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:40:05,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 13:40:05,308 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:40:05,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:40:05,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:40:05,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:40:05,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 13:40:05,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:40:05,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 13:40:05,311 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:40:05,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 13:40:05,311 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:40:05,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:40:05,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:40:05,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:40:05,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:40:05,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:40:05,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:40:05,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 13:40:05,313 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 13:40:05,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 13:40:05,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:40:05,314 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 13:40:05,314 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:40:05,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:40:05,314 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_e3970246-4732-41b3-8033-df08ab8c206e/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_e3970246-4732-41b3-8033-df08ab8c206e/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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2023-12-02 13:40:05,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:40:05,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:40:05,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:40:05,546 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:40:05,547 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:40:05,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-12-02 13:40:08,323 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:40:08,586 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:40:08,587 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-12-02 13:40:08,603 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/data/d1d4c4167/3ead7da9b12d4b52be4de3d3cac8bcde/FLAG2af16fc63 [2023-12-02 13:40:08,620 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/data/d1d4c4167/3ead7da9b12d4b52be4de3d3cac8bcde [2023-12-02 13:40:08,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:40:08,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:40:08,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:40:08,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:40:08,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:40:08,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:40:08" (1/1) ... [2023-12-02 13:40:08,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e82819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:08, skipping insertion in model container [2023-12-02 13:40:08,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:40:08" (1/1) ... [2023-12-02 13:40:08,690 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:40:08,990 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_e3970246-4732-41b3-8033-df08ab8c206e/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2023-12-02 13:40:08,994 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:40:09,003 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:40:09,039 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_e3970246-4732-41b3-8033-df08ab8c206e/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2023-12-02 13:40:09,040 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:40:09,070 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:40:09,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:09 WrapperNode [2023-12-02 13:40:09,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:40:09,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:40:09,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:40:09,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:40:09,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:09" (1/1) ... [2023-12-02 13:40:09,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:09" (1/1) ... [2023-12-02 13:40:09,112 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2023-12-02 13:40:09,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:40:09,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:40:09,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:40:09,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:40:09,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:09" (1/1) ... [2023-12-02 13:40:09,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:09" (1/1) ... [2023-12-02 13:40:09,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:09" (1/1) ... [2023-12-02 13:40:09,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:09" (1/1) ... [2023-12-02 13:40:09,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:09" (1/1) ... [2023-12-02 13:40:09,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:09" (1/1) ... [2023-12-02 13:40:09,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:09" (1/1) ... [2023-12-02 13:40:09,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:09" (1/1) ... [2023-12-02 13:40:09,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:40:09,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:40:09,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:40:09,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:40:09,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:09" (1/1) ... [2023-12-02 13:40:09,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:40:09,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:40:09,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 13:40:09,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 13:40:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 13:40:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 13:40:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 13:40:09,215 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 13:40:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 13:40:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:40:09,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 13:40:09,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 13:40:09,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 13:40:09,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 13:40:09,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 13:40:09,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 13:40:09,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:40:09,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:40:09,328 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:40:09,330 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:40:09,507 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:40:09,553 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:40:09,553 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 13:40:09,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:40:09 BoogieIcfgContainer [2023-12-02 13:40:09,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:40:09,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:40:09,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:40:09,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:40:09,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:40:08" (1/3) ... [2023-12-02 13:40:09,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25976e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:40:09, skipping insertion in model container [2023-12-02 13:40:09,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:09" (2/3) ... [2023-12-02 13:40:09,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25976e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:40:09, skipping insertion in model container [2023-12-02 13:40:09,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:40:09" (3/3) ... [2023-12-02 13:40:09,564 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2023-12-02 13:40:09,584 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:40:09,584 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 13:40:09,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:40:09,641 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;@1e95d822, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:40:09,642 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 13:40:09,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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 13:40:09,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 13:40:09,655 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:40:09,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:40:09,656 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:40:09,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:40:09,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1395858267, now seen corresponding path program 1 times [2023-12-02 13:40:09,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:40:09,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960554401] [2023-12-02 13:40:09,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:40:09,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:40:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:40:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:40:10,007 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:40:10,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960554401] [2023-12-02 13:40:10,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960554401] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:40:10,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:40:10,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:40:10,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305715715] [2023-12-02 13:40:10,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:40:10,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:40:10,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:40:10,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:40:10,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:40:10,044 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 13:40:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:40:10,084 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2023-12-02 13:40:10,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:40:10,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-02 13:40:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:40:10,091 INFO L225 Difference]: With dead ends: 45 [2023-12-02 13:40:10,091 INFO L226 Difference]: Without dead ends: 22 [2023-12-02 13:40:10,093 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 13:40:10,097 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 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 13:40:10,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:40:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-02 13:40:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2023-12-02 13:40:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 13:40:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-12-02 13:40:10,127 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2023-12-02 13:40:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:40:10,127 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-12-02 13:40:10,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 13:40:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-12-02 13:40:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 13:40:10,129 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:40:10,129 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:40:10,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 13:40:10,129 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:40:10,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:40:10,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1325684686, now seen corresponding path program 1 times [2023-12-02 13:40:10,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:40:10,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60629404] [2023-12-02 13:40:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:40:10,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:40:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:40:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 13:40:10,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:40:10,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60629404] [2023-12-02 13:40:10,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60629404] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:40:10,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660963886] [2023-12-02 13:40:10,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:40:10,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:40:10,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:40:10,284 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:40:10,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 13:40:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:40:10,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 13:40:10,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:40:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:40:10,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:40:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 13:40:10,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660963886] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:40:10,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [955172737] [2023-12-02 13:40:10,546 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-12-02 13:40:10,546 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:40:10,549 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:40:10,577 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:40:10,578 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:40:12,763 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-12-02 13:40:13,021 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:40:28,686 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '222#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |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_sll_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) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_append_#in~head#1.base_9| Int) (|v_ULTIMATE.start_sll_append_~head#1.base_13| Int)) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_sll_append_~head#1.base_13| (store (select |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0 0))) (or (and (exists ((|v_#length_23| (Array Int Int))) (= (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_52| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_52| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (store (select |v_#memory_$Pointer$.base_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.base_53|)) (exists ((|v_#memory_int_31| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= |v_#memory_int_54| (store |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0 1))) (= |v_#memory_int_31| (store |v_#memory_int_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 (select (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4)))))) (exists ((|v_#memory_int_53| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_53| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_53| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (store (select |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.offset_53|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_52| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_52| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_9| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_33| (Array Int Int))) (and (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0) (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 1) |#valid|))) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_9| |v_ULTIMATE.start_sll_append_~head#1.base_13|)) (and (exists ((|v_#memory_int_53| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (store |v_#memory_int_53| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_53| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_int)_AFTER_CALL_9|)) (exists ((|v_#length_23| (Array Int Int))) (= (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (store (select |v_#memory_$Pointer$.base_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.base_53|)) (exists ((|v_#memory_int_31| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= |v_#memory_int_54| (store |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0 1))) (= |v_#memory_int_31| (store |v_#memory_int_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 (select (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4)))))) (exists ((|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (store (select |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.offset_53|)) (exists ((|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_52| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_52| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_52| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_52| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_9| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_33| (Array Int Int))) (and (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0) (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 1) |#valid|))) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_9| |v_ULTIMATE.start_sll_append_~head#1.base_13|))) (= (select (select |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 0) (= (select (select |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 0) (= |#memory_int| (store |v_#memory_int_54| |v_ULTIMATE.start_sll_append_~head#1.base_13| (store (select |v_#memory_int_54| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)))) (= (store |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_sll_append_~head#1.base_13| (store (select |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0))) |#memory_$Pointer$.base|))))' at error location [2023-12-02 13:40:28,686 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:40:28,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:40:28,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-12-02 13:40:28,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615587485] [2023-12-02 13:40:28,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:40:28,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:40:28,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:40:28,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:40:28,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=262, Unknown=6, NotChecked=0, Total=306 [2023-12-02 13:40:28,691 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 13:40:28,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:40:28,724 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2023-12-02 13:40:28,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:40:28,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2023-12-02 13:40:28,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:40:28,726 INFO L225 Difference]: With dead ends: 38 [2023-12-02 13:40:28,726 INFO L226 Difference]: Without dead ends: 23 [2023-12-02 13:40:28,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=38, Invalid=262, Unknown=6, NotChecked=0, Total=306 [2023-12-02 13:40:28,728 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:40:28,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 52 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:40:28,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-02 13:40:28,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-02 13:40:28,734 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 13:40:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-12-02 13:40:28,735 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2023-12-02 13:40:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:40:28,736 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-12-02 13:40:28,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 13:40:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-12-02 13:40:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 13:40:28,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:40:28,738 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:40:28,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 13:40:28,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:40:28,939 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:40:28,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:40:28,939 INFO L85 PathProgramCache]: Analyzing trace with hash 593834497, now seen corresponding path program 2 times [2023-12-02 13:40:28,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:40:28,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106020807] [2023-12-02 13:40:28,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:40:28,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:40:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:40:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 13:40:29,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:40:29,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106020807] [2023-12-02 13:40:29,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106020807] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:40:29,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290726479] [2023-12-02 13:40:29,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:40:29,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:40:29,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:40:29,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:40:29,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 13:40:29,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-12-02 13:40:29,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:40:29,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-02 13:40:29,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:40:29,686 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 13:40:29,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:40:29,846 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 13:40:29,857 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 13:40:29,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 13:40:29,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-02 13:40:29,916 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 13:40:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 13:40:29,970 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:40:29,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290726479] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:40:29,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:40:29,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2023-12-02 13:40:29,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303972503] [2023-12-02 13:40:29,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:40:29,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:40:29,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:40:29,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:40:29,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2023-12-02 13:40:29,972 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 13:40:30,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:40:30,362 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2023-12-02 13:40:30,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 13:40:30,363 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-12-02 13:40:30,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:40:30,364 INFO L225 Difference]: With dead ends: 36 [2023-12-02 13:40:30,364 INFO L226 Difference]: Without dead ends: 34 [2023-12-02 13:40:30,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2023-12-02 13:40:30,367 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 54 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:40:30,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 64 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:40:30,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-02 13:40:30,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2023-12-02 13:40:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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 13:40:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-12-02 13:40:30,376 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 24 [2023-12-02 13:40:30,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:40:30,376 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-12-02 13:40:30,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 13:40:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-12-02 13:40:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 13:40:30,378 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:40:30,378 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:40:30,383 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 13:40:30,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:40:30,579 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:40:30,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:40:30,579 INFO L85 PathProgramCache]: Analyzing trace with hash 593890483, now seen corresponding path program 1 times [2023-12-02 13:40:30,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:40:30,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566026117] [2023-12-02 13:40:30,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:40:30,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:40:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:40:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 13:40:30,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:40:30,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566026117] [2023-12-02 13:40:30,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566026117] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:40:30,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:40:30,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 13:40:30,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749342059] [2023-12-02 13:40:30,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:40:30,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 13:40:30,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:40:30,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 13:40:30,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:40:30,853 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 13:40:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:40:30,959 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2023-12-02 13:40:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 13:40:30,960 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-12-02 13:40:30,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:40:30,961 INFO L225 Difference]: With dead ends: 34 [2023-12-02 13:40:30,962 INFO L226 Difference]: Without dead ends: 31 [2023-12-02 13:40:30,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-02 13:40:30,963 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:40:30,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 90 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:40:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-02 13:40:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2023-12-02 13:40:30,970 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 13:40:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-12-02 13:40:30,971 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 24 [2023-12-02 13:40:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:40:30,972 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-12-02 13:40:30,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 13:40:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-12-02 13:40:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 13:40:30,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:40:30,973 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:40:30,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 13:40:30,974 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:40:30,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:40:30,974 INFO L85 PathProgramCache]: Analyzing trace with hash -555664292, now seen corresponding path program 1 times [2023-12-02 13:40:30,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:40:30,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950946996] [2023-12-02 13:40:30,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:40:30,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:40:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:40:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 13:40:31,447 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:40:31,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950946996] [2023-12-02 13:40:31,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950946996] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:40:31,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621086505] [2023-12-02 13:40:31,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:40:31,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:40:31,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:40:31,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:40:31,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 13:40:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:40:31,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 13:40:31,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:40:31,768 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 13:40:31,792 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-12-02 13:40:31,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:40:31,805 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 13:40:31,831 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 13:40:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2023-12-02 13:40:31,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:40:31,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621086505] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:40:31,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1203003504] [2023-12-02 13:40:31,963 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-12-02 13:40:31,963 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:40:31,963 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:40:31,964 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:40:31,964 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:40:33,246 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 120 for LOIs [2023-12-02 13:40:33,425 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:40:39,075 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '726#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_sll_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) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 13:40:39,075 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:40:39,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:40:39,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-12-02 13:40:39,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414246555] [2023-12-02 13:40:39,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 13:40:39,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 13:40:39,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:40:39,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 13:40:39,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1014, Unknown=7, NotChecked=64, Total=1190 [2023-12-02 13:40:39,078 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 20 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 13:40:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:40:39,404 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2023-12-02 13:40:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 13:40:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 26 [2023-12-02 13:40:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:40:39,405 INFO L225 Difference]: With dead ends: 31 [2023-12-02 13:40:39,406 INFO L226 Difference]: Without dead ends: 23 [2023-12-02 13:40:39,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=149, Invalid=1329, Unknown=8, NotChecked=74, Total=1560 [2023-12-02 13:40:39,407 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:40:39,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 119 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 26 Unchecked, 0.2s Time] [2023-12-02 13:40:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-02 13:40:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-02 13:40:39,411 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 13:40:39,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-12-02 13:40:39,411 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 26 [2023-12-02 13:40:39,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:40:39,412 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-12-02 13:40:39,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 13:40:39,412 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-12-02 13:40:39,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 13:40:39,413 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:40:39,413 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:40:39,418 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 13:40:39,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:40:39,614 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:40:39,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:40:39,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1765547303, now seen corresponding path program 1 times [2023-12-02 13:40:39,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:40:39,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711543112] [2023-12-02 13:40:39,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:40:39,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:40:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:40:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 13:40:41,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:40:41,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711543112] [2023-12-02 13:40:41,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711543112] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:40:41,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553278829] [2023-12-02 13:40:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:40:41,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:40:41,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:40:41,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:40:41,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 13:40:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:40:41,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 87 conjunts are in the unsatisfiable core [2023-12-02 13:40:41,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:40:41,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 13:40:41,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 13:40:41,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:40:41,988 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2023-12-02 13:40:41,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 13:40:41,997 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 13:40:42,095 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 13:40:42,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:40:42,118 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 13:40:42,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:40:42,138 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 13:40:42,138 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 47 treesize of output 42 [2023-12-02 13:40:42,155 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 13:40:42,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-02 13:40:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-12-02 13:40:42,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:40:42,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553278829] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:40:42,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [426130069] [2023-12-02 13:40:42,751 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 13:40:42,752 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:40:42,752 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:40:42,752 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:40:42,753 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:40:44,200 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-12-02 13:40:44,382 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:40:51,798 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_append_#in~data#1| 1) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~data#1| 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse2) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (not (= .cse2 0)) (not (= .cse0 0))) (<= 2 |c_ULTIMATE.start_sll_append_~head#1.base|) (let ((.cse3 (exists ((|v_#length_37| (Array Int Int))) (= (store |v_#length_37| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |c_#length|))) (.cse4 (= |c_ULTIMATE.start_sll_append_#in~head#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse5 (= |c_ULTIMATE.start_sll_append_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0))) (.cse7 (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_75| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_75| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (.cse8 (exists ((|v_#memory_$Pointer$.offset_78| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_78| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_78| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (.cse9 (exists ((|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_79| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_79| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (.cse10 (exists ((|v_#valid_50| (Array Int Int))) (and (= (select |v_#valid_50| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_50| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 1))))) (.cse11 (exists ((|v_#memory_int_95| (Array Int (Array Int Int))) (|v_#memory_int_31| (Array Int (Array Int Int)))) (let ((.cse13 (select |v_#memory_int_31| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|))) (and (= (store |v_#memory_int_95| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_95| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select .cse13 4))) |v_#memory_int_31|) (= (store |v_#memory_int_31| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| (store .cse13 0 1)) |c_#memory_int|))))) (.cse12 (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_#memory_$Pointer$.base_82| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_35| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| (store |v_#memory_$Pointer$.base_82| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_82| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) .cse8 .cse9 .cse10 .cse11 (exists ((|v_old(#memory_int)_AFTER_CALL_35| (Array Int (Array Int Int))) (|v_#memory_int_98| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_35| (store |v_#memory_int_98| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_98| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_35| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))))) .cse12) (and (exists ((|v_#memory_int_98| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_34| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_34| (store |v_#memory_int_98| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_98| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_34| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_#memory_$Pointer$.base_82| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_34| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_82| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_82| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_34|) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) |c_ULTIMATE.start_sll_create_#res#1.base|))) .cse12))) (= |c_ULTIMATE.start_main_~len~0#1| 2) (<= 2 |c_ULTIMATE.start_sll_append_#in~head#1.base|))) is different from true [2023-12-02 13:41:08,382 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '971#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |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_sll_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) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= (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_append_~head#1.base_17| Int) (|v_#memory_int_99| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_83| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_append_#in~head#1.base_13| Int)) (and (= |#memory_int| (store |v_#memory_int_99| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0) (store (select |v_#memory_int_99| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))))) (= (select (select |v_#memory_$Pointer$.base_83| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 0) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_79| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0) (store (select |v_#memory_$Pointer$.offset_79| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) 0))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_83| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0) (store (select |v_#memory_$Pointer$.base_83| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))))) (= (select (select |v_#memory_$Pointer$.offset_79| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 0) (or (and (exists ((|v_#memory_int_95| (Array Int (Array Int Int))) (|v_#memory_int_31| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_95| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (store (select |v_#memory_int_95| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 4 (select (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 4))) |v_#memory_int_31|) (= |v_#memory_int_99| (store |v_#memory_int_31| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (store (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 0 1))))) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_75| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (store (store (select |v_#memory_$Pointer$.offset_75| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_79| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 0))) |v_#memory_$Pointer$.offset_79|)) (exists ((|v_#memory_int_98| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_34| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_34| (store |v_#memory_int_98| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_98| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_34| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_79| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (store (store (select |v_#memory_$Pointer$.base_79| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 4 0) 0 (select (select |v_#memory_$Pointer$.base_83| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 0))) |v_#memory_$Pointer$.base_83|)) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_78| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_13| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_37| (Array Int Int))) (= |#length| (store |v_#length_37| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 8))) (not (= (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 0)) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_13| |v_ULTIMATE.start_sll_append_~head#1.base_17|) (exists ((|v_#valid_50| (Array Int Int))) (and (= (select |v_#valid_50| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 0) (= (store |v_#valid_50| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_82| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_34| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= (store |v_#memory_$Pointer$.base_82| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_82| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_34|)))) (and (exists ((|v_#memory_$Pointer$.base_82| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_35| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| (store |v_#memory_$Pointer$.base_82| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_82| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (exists ((|v_#memory_int_95| (Array Int (Array Int Int))) (|v_#memory_int_31| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_95| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (store (select |v_#memory_int_95| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 4 (select (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 4))) |v_#memory_int_31|) (= |v_#memory_int_99| (store |v_#memory_int_31| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (store (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 0 1))))) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_75| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (store (store (select |v_#memory_$Pointer$.offset_75| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_79| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 0))) |v_#memory_$Pointer$.offset_79|)) (exists ((|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_79| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (store (store (select |v_#memory_$Pointer$.base_79| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 4 0) 0 (select (select |v_#memory_$Pointer$.base_83| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 0))) |v_#memory_$Pointer$.base_83|)) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_78| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_13| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_37| (Array Int Int))) (= |#length| (store |v_#length_37| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 8))) (not (= (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 0)) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_13| |v_ULTIMATE.start_sll_append_~head#1.base_17|) (exists ((|v_#valid_50| (Array Int Int))) (and (= (select |v_#valid_50| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 0) (= (store |v_#valid_50| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 1) |#valid|))) (exists ((|v_old(#memory_int)_AFTER_CALL_35| (Array Int (Array Int Int))) (|v_#memory_int_98| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_35| (store |v_#memory_int_98| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_98| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_35| |ULTIMATE.start_sll_create_#res#1.base|) 4))))))))))' at error location [2023-12-02 13:41:08,382 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:41:08,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:41:08,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 36 [2023-12-02 13:41:08,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051031249] [2023-12-02 13:41:08,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 13:41:08,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 13:41:08,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:41:08,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 13:41:08,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2690, Unknown=12, NotChecked=210, Total=3080 [2023-12-02 13:41:08,386 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 13:41:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:41:10,166 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2023-12-02 13:41:10,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 13:41:10,166 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2023-12-02 13:41:10,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:41:10,167 INFO L225 Difference]: With dead ends: 34 [2023-12-02 13:41:10,167 INFO L226 Difference]: Without dead ends: 27 [2023-12-02 13:41:10,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=298, Invalid=3982, Unknown=18, NotChecked=258, Total=4556 [2023-12-02 13:41:10,170 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 43 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:41:10,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 213 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 490 Invalid, 0 Unknown, 32 Unchecked, 0.4s Time] [2023-12-02 13:41:10,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-02 13:41:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-12-02 13:41:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 13:41:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-12-02 13:41:10,177 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 27 [2023-12-02 13:41:10,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:41:10,178 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-12-02 13:41:10,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 13:41:10,178 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-12-02 13:41:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 13:41:10,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:41:10,179 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:41:10,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-02 13:41:10,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:41:10,380 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:41:10,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:41:10,380 INFO L85 PathProgramCache]: Analyzing trace with hash -267643454, now seen corresponding path program 1 times [2023-12-02 13:41:10,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:41:10,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565976043] [2023-12-02 13:41:10,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:41:10,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:41:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:41:12,118 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 13:41:12,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:41:12,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565976043] [2023-12-02 13:41:12,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565976043] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:41:12,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511995809] [2023-12-02 13:41:12,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:41:12,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:41:12,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:41:12,120 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:41:12,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 13:41:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:41:12,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 124 conjunts are in the unsatisfiable core [2023-12-02 13:41:12,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:41:12,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 13:41:12,736 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 13:41:12,834 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 13:41:12,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 13:41:12,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 13:41:12,950 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 13:41:13,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:41:13,168 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 34 [2023-12-02 13:41:13,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 13:41:13,176 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 13:41:13,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 13:41:13,259 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |node_create_~temp~0#1.base| (select |c_#memory_int| |node_create_~temp~0#1.base|)) |c_#memory_int|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 13:41:13,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:13,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 13:41:13,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:13,303 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 13:41:13,303 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 75 treesize of output 60 [2023-12-02 13:41:13,332 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 13:41:13,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 13:41:13,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:13,340 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 13:41:13,888 INFO L349 Elim1Store]: treesize reduction 79, result has 24.8 percent of original size [2023-12-02 13:41:13,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 172 treesize of output 97 [2023-12-02 13:41:13,897 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 13:41:13,913 INFO L349 Elim1Store]: treesize reduction 59, result has 10.6 percent of original size [2023-12-02 13:41:13,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 11 [2023-12-02 13:41:13,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:41:13,995 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 27 [2023-12-02 13:41:14,000 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 13:41:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 13:41:14,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:41:14,124 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 Int) (v_ArrVal_637 Int) (v_ArrVal_640 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_640) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_637)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_641)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-12-02 13:41:14,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511995809] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:41:14,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1736311035] [2023-12-02 13:41:15,001 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 13:41:15,002 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:41:15,002 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:41:15,002 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:41:15,002 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:41:15,950 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-12-02 13:41:16,094 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:41:22,412 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1261#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (exists ((|v_#memory_$Pointer$.offset_94| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_99| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_append_~last~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_26| Int) (|v_#memory_int_124| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_append_~last~0#1.base_26| (store (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4)))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_94| |v_ULTIMATE.start_sll_append_~last~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_94| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4) 0))) (= (select (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4)) 0) (= (select (select |v_#memory_$Pointer$.offset_94| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4)) 0) (= |#memory_int| (store |v_#memory_int_124| |v_ULTIMATE.start_sll_append_~last~0#1.base_26| (store (select |v_#memory_int_124| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4) (select (select |#memory_int| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4))))))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |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_sll_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) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= (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 13:41:22,412 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:41:22,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:41:22,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2023-12-02 13:41:22,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367905115] [2023-12-02 13:41:22,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 13:41:22,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-02 13:41:22,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:41:22,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-02 13:41:22,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=3700, Unknown=7, NotChecked=246, Total=4160 [2023-12-02 13:41:22,416 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 43 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 13:41:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:41:25,015 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2023-12-02 13:41:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 13:41:25,016 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2023-12-02 13:41:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:41:25,017 INFO L225 Difference]: With dead ends: 41 [2023-12-02 13:41:25,017 INFO L226 Difference]: Without dead ends: 38 [2023-12-02 13:41:25,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=400, Invalid=5917, Unknown=11, NotChecked=314, Total=6642 [2023-12-02 13:41:25,020 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 13:41:25,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 180 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 780 Invalid, 0 Unknown, 45 Unchecked, 0.7s Time] [2023-12-02 13:41:25,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-02 13:41:25,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2023-12-02 13:41:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:41:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-12-02 13:41:25,027 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 29 [2023-12-02 13:41:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:41:25,027 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-12-02 13:41:25,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 13:41:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-12-02 13:41:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 13:41:25,029 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:41:25,029 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:41:25,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 13:41:25,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 13:41:25,229 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:41:25,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:41:25,230 INFO L85 PathProgramCache]: Analyzing trace with hash 492712925, now seen corresponding path program 1 times [2023-12-02 13:41:25,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:41:25,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489298545] [2023-12-02 13:41:25,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:41:25,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:41:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:41:27,584 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:41:27,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:41:27,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489298545] [2023-12-02 13:41:27,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489298545] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:41:27,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688589559] [2023-12-02 13:41:27,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:41:27,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:41:27,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:41:27,586 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:41:27,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 13:41:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:41:27,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 157 conjunts are in the unsatisfiable core [2023-12-02 13:41:27,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:41:27,813 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 13:41:27,877 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 13:41:27,945 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 13:41:28,031 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 13:41:28,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 13:41:28,117 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 13:41:28,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 13:41:28,361 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 13:41:28,361 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 13:41:28,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:28,400 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 13:41:28,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-12-02 13:41:28,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 13:41:28,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 13:41:28,577 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 13:41:28,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:41:28,870 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 49 [2023-12-02 13:41:28,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:28,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-12-02 13:41:28,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:28,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 13:41:28,968 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |node_create_~temp~0#1.base| (select |c_#memory_int| |node_create_~temp~0#1.base|)) |c_#memory_int|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 13:41:29,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:29,017 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 13:41:29,017 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 114 treesize of output 81 [2023-12-02 13:41:29,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:29,030 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 24 treesize of output 19 [2023-12-02 13:41:29,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:29,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:29,059 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 13:41:29,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 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 13:41:29,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:29,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:29,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-12-02 13:41:29,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:29,772 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2023-12-02 13:41:29,772 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 230 treesize of output 112 [2023-12-02 13:41:29,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:29,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 25 [2023-12-02 13:41:29,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:29,797 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 59 treesize of output 19 [2023-12-02 13:41:30,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:41:30,071 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 42 [2023-12-02 13:41:30,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:30,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 13:41:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 13:41:30,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:41:30,439 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_782 Int) (v_ArrVal_781 Int) (v_ArrVal_783 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (or (not (= (store (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 (select v_ArrVal_783 .cse0)) v_ArrVal_783)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_781))) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_782)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_783) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))))))) is different from false [2023-12-02 13:41:31,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688589559] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:41:31,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1811132604] [2023-12-02 13:41:31,656 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 13:41:31,656 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:41:31,657 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:41:31,657 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:41:31,657 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:41:32,443 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 120 for LOIs [2023-12-02 13:41:32,608 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:41:37,437 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1599#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_sll_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) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 13:41:37,437 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:41:37,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:41:37,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 47 [2023-12-02 13:41:37,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367269039] [2023-12-02 13:41:37,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 13:41:37,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-02 13:41:37,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:41:37,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-02 13:41:37,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4861, Unknown=10, NotChecked=282, Total=5402 [2023-12-02 13:41:37,442 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 48 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 13:41:40,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:41:40,698 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2023-12-02 13:41:40,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 13:41:40,699 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2023-12-02 13:41:40,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:41:40,699 INFO L225 Difference]: With dead ends: 43 [2023-12-02 13:41:40,699 INFO L226 Difference]: Without dead ends: 40 [2023-12-02 13:41:40,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1849 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=447, Invalid=7380, Unknown=13, NotChecked=350, Total=8190 [2023-12-02 13:41:40,704 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 13:41:40,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 251 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 930 Invalid, 0 Unknown, 47 Unchecked, 0.9s Time] [2023-12-02 13:41:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-02 13:41:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2023-12-02 13:41:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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 13:41:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-12-02 13:41:40,711 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 31 [2023-12-02 13:41:40,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:41:40,711 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-12-02 13:41:40,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 13:41:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-12-02 13:41:40,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 13:41:40,712 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:41:40,712 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:41:40,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-02 13:41:40,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:41:40,913 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:41:40,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:41:40,914 INFO L85 PathProgramCache]: Analyzing trace with hash 46158749, now seen corresponding path program 2 times [2023-12-02 13:41:40,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:41:40,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971263219] [2023-12-02 13:41:40,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:41:40,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:41:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:41:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:41:43,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:41:43,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971263219] [2023-12-02 13:41:43,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971263219] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:41:43,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400063453] [2023-12-02 13:41:43,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:41:43,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:41:43,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:41:43,500 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:41:43,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 13:41:43,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 13:41:43,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:41:43,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 151 conjunts are in the unsatisfiable core [2023-12-02 13:41:43,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:41:43,755 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 13:41:43,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 13:41:44,061 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 13:41:44,182 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 13:41:44,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 13:41:44,196 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 18 treesize of output 13 [2023-12-02 13:41:44,333 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 13:41:44,343 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 33 treesize of output 21 [2023-12-02 13:41:44,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 13:41:44,620 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-12-02 13:41:44,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 58 [2023-12-02 13:41:44,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:44,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-12-02 13:41:44,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 13:41:44,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 13:41:44,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-02 13:41:44,746 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (let ((.cse0 (select |c_#memory_int| |node_create_~temp~0#1.base|))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (= (select .cse0 0) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2023-12-02 13:41:44,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:44,790 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-02 13:41:44,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 83 [2023-12-02 13:41:44,815 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 13:41:44,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 13:41:44,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:44,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:44,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2023-12-02 13:41:44,835 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 20 treesize of output 15 [2023-12-02 13:41:46,239 INFO L349 Elim1Store]: treesize reduction 141, result has 23.4 percent of original size [2023-12-02 13:41:46,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 118 treesize of output 92 [2023-12-02 13:41:46,259 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 13:41:46,259 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 1 case distinctions, treesize of input 27 treesize of output 29 [2023-12-02 13:41:46,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:46,304 INFO L349 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2023-12-02 13:41:46,305 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 76 treesize of output 55 [2023-12-02 13:41:46,585 INFO L349 Elim1Store]: treesize reduction 15, result has 66.7 percent of original size [2023-12-02 13:41:46,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 159 treesize of output 121 [2023-12-02 13:41:46,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:41:46,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:41:46,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 56 [2023-12-02 13:41:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 13:41:46,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:41:46,798 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_927 Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_926 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_925) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_927)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_926)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-12-02 13:41:47,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:41:47,804 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 331 treesize of output 335 [2023-12-02 13:41:48,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400063453] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:41:48,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [640559793] [2023-12-02 13:41:48,382 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 13:41:48,382 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:41:48,382 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:41:48,382 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:41:48,382 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:41:49,167 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-12-02 13:41:49,317 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:41:56,269 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1942#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_main_~count~0#1| 0) (exists ((|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_append_~last~0#1.base_44| Int) (|v_#memory_int_177| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_44| Int)) (and (= (store |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_sll_append_~last~0#1.base_44| (store (select |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_sll_append_~last~0#1.base_44|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_44|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4)))) |#memory_$Pointer$.base|) (= (select (select |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_sll_append_~last~0#1.base_44|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4)) 0) (= |#memory_int| (store |v_#memory_int_177| |v_ULTIMATE.start_sll_append_~last~0#1.base_44| (store (select |v_#memory_int_177| |v_ULTIMATE.start_sll_append_~last~0#1.base_44|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4) (select (select |#memory_int| |v_ULTIMATE.start_sll_append_~last~0#1.base_44|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4))))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_sll_append_~last~0#1.base_44| (store (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_sll_append_~last~0#1.base_44|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4) 0))) (= (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_sll_append_~last~0#1.base_44|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4)) 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_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) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= (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 13:41:56,269 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:41:56,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:41:56,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 49 [2023-12-02 13:41:56,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247516675] [2023-12-02 13:41:56,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 13:41:56,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-02 13:41:56,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:41:56,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-02 13:41:56,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=4718, Unknown=9, NotChecked=278, Total=5256 [2023-12-02 13:41:56,272 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 49 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 13:42:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:42:00,474 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2023-12-02 13:42:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 13:42:00,475 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2023-12-02 13:42:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:42:00,481 INFO L225 Difference]: With dead ends: 73 [2023-12-02 13:42:00,481 INFO L226 Difference]: Without dead ends: 70 [2023-12-02 13:42:00,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1854 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=476, Invalid=7712, Unknown=10, NotChecked=358, Total=8556 [2023-12-02 13:42:00,484 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 68 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:42:00,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 303 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1215 Invalid, 0 Unknown, 71 Unchecked, 1.3s Time] [2023-12-02 13:42:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-02 13:42:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 47. [2023-12-02 13:42:00,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 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 13:42:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2023-12-02 13:42:00,499 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 31 [2023-12-02 13:42:00,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:42:00,500 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2023-12-02 13:42:00,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 13:42:00,500 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2023-12-02 13:42:00,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 13:42:00,501 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:42:00,501 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:42:00,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 13:42:00,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:42:00,702 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:42:00,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:42:00,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1050752824, now seen corresponding path program 2 times [2023-12-02 13:42:00,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:42:00,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599027366] [2023-12-02 13:42:00,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:00,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:42:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 13:42:03,500 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:42:03,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599027366] [2023-12-02 13:42:03,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599027366] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:42:03,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749176631] [2023-12-02 13:42:03,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:42:03,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:42:03,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:42:03,501 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:42:03,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 13:42:03,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 13:42:03,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:42:03,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 158 conjunts are in the unsatisfiable core [2023-12-02 13:42:03,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:42:03,728 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 13:42:03,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 13:42:03,905 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 13:42:03,906 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 13:42:04,067 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 13:42:04,218 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-12-02 13:42:04,218 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 4 case distinctions, treesize of input 22 treesize of output 33 [2023-12-02 13:42:04,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 13:42:04,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 13:42:04,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:42:04,582 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 30 [2023-12-02 13:42:04,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 13:42:04,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-12-02 13:42:04,610 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 13:42:04,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:04,714 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 13:42:04,715 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 75 treesize of output 56 [2023-12-02 13:42:04,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:04,739 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 13:42:04,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 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 13:42:04,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:04,749 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 13:42:05,656 INFO L349 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2023-12-02 13:42:05,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 310 treesize of output 151 [2023-12-02 13:42:05,668 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 54 treesize of output 33 [2023-12-02 13:42:05,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 130 [2023-12-02 13:42:06,414 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-02 13:42:06,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 215 treesize of output 68 [2023-12-02 13:42:06,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2023-12-02 13:42:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 13:42:06,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:42:07,021 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1063 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|))) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (+ (select (select .cse3 .cse4) .cse5) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1063) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))))) is different from false [2023-12-02 13:42:08,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:42:08,001 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1299 treesize of output 1300 [2023-12-02 13:42:08,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:42:08,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3221 treesize of output 3224 [2023-12-02 13:42:08,036 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 1290 treesize of output 659 [2023-12-02 13:42:09,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749176631] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:42:09,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1726482540] [2023-12-02 13:42:09,032 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 13:42:09,032 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:42:09,033 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:42:09,033 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:42:09,033 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:42:09,979 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 120 for LOIs [2023-12-02 13:42:10,160 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:42:15,862 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2371#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_sll_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) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 13:42:15,862 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:42:15,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:42:15,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 50 [2023-12-02 13:42:15,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061097709] [2023-12-02 13:42:15,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 13:42:15,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-02 13:42:15,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:42:15,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-02 13:42:15,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=5928, Unknown=9, NotChecked=154, Total=6320 [2023-12-02 13:42:15,865 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 51 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 42 states have internal predecessors, (52), 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 13:42:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:42:24,123 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2023-12-02 13:42:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-02 13:42:24,124 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 42 states have internal predecessors, (52), 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 33 [2023-12-02 13:42:24,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:42:24,125 INFO L225 Difference]: With dead ends: 88 [2023-12-02 13:42:24,125 INFO L226 Difference]: Without dead ends: 86 [2023-12-02 13:42:24,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2922 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=665, Invalid=13368, Unknown=13, NotChecked=234, Total=14280 [2023-12-02 13:42:24,128 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 166 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:42:24,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 263 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 13:42:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-02 13:42:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 50. [2023-12-02 13:42:24,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 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 13:42:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2023-12-02 13:42:24,147 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 33 [2023-12-02 13:42:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:42:24,147 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2023-12-02 13:42:24,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 42 states have internal predecessors, (52), 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 13:42:24,147 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2023-12-02 13:42:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 13:42:24,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:42:24,149 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:42:24,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 13:42:24,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 13:42:24,349 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:42:24,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:42:24,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1050808810, now seen corresponding path program 1 times [2023-12-02 13:42:24,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:42:24,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070826867] [2023-12-02 13:42:24,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:24,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:42:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:42:26,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:42:26,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070826867] [2023-12-02 13:42:26,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070826867] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:42:26,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251483279] [2023-12-02 13:42:26,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:26,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:42:26,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:42:26,437 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:42:26,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 13:42:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:26,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 123 conjunts are in the unsatisfiable core [2023-12-02 13:42:26,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:42:26,695 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 13:42:26,891 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 13:42:27,006 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 13:42:27,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 13:42:27,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 13:42:27,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:42:27,317 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2023-12-02 13:42:27,320 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 13:42:27,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 13:42:27,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:27,493 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 13:42:27,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2023-12-02 13:42:27,517 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 13:42:27,517 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 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 13:42:27,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:27,536 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 16 treesize of output 11 [2023-12-02 13:42:28,404 INFO L349 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2023-12-02 13:42:28,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 298 treesize of output 147 [2023-12-02 13:42:28,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:28,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:42:28,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 141 [2023-12-02 13:42:28,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:42:28,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 92 [2023-12-02 13:42:29,035 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2023-12-02 13:42:29,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 40 [2023-12-02 13:42:29,040 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:42:29,040 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:42:30,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251483279] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:42:30,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [180960155] [2023-12-02 13:42:30,400 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-12-02 13:42:30,400 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:42:30,401 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:42:30,401 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:42:30,401 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:42:31,158 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 120 for LOIs [2023-12-02 13:42:31,329 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:42:36,585 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2859#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= |ULTIMATE.start_main_~count~0#1| 3)) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (= |ULTIMATE.start_sll_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) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 13:42:36,585 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:42:36,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:42:36,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 51 [2023-12-02 13:42:36,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682749188] [2023-12-02 13:42:36,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 13:42:36,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-02 13:42:36,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:42:36,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-02 13:42:36,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=5770, Unknown=6, NotChecked=0, Total=6006 [2023-12-02 13:42:36,587 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 51 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 41 states have internal predecessors, (50), 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 13:42:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:42:40,769 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2023-12-02 13:42:40,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 13:42:40,770 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 41 states have internal predecessors, (50), 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 33 [2023-12-02 13:42:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:42:40,770 INFO L225 Difference]: With dead ends: 59 [2023-12-02 13:42:40,770 INFO L226 Difference]: Without dead ends: 56 [2023-12-02 13:42:40,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1768 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=516, Invalid=9576, Unknown=8, NotChecked=0, Total=10100 [2023-12-02 13:42:40,772 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 118 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 13:42:40,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 395 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 13:42:40,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-02 13:42:40,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2023-12-02 13:42:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 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 13:42:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-12-02 13:42:40,789 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 33 [2023-12-02 13:42:40,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:42:40,789 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-12-02 13:42:40,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 41 states have internal predecessors, (50), 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 13:42:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-12-02 13:42:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 13:42:40,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:42:40,791 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:42:40,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 13:42:40,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:42:40,993 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:42:40,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:42:40,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1408919288, now seen corresponding path program 3 times [2023-12-02 13:42:40,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:42:40,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456980601] [2023-12-02 13:42:40,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:40,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:42:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 13:42:42,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:42:42,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456980601] [2023-12-02 13:42:42,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456980601] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:42:42,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092878832] [2023-12-02 13:42:42,188 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 13:42:42,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:42:42,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:42:42,189 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:42:42,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 13:42:42,586 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 13:42:42,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:42:42,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 134 conjunts are in the unsatisfiable core [2023-12-02 13:42:42,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:42:42,632 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 13:42:42,689 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 13:42:42,693 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 13:42:42,814 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 13:42:42,814 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 13:42:42,834 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 13:42:42,834 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 13:42:42,866 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 13:42:42,866 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 13:42:42,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-02 13:42:42,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 13:42:43,133 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 13:42:43,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 38 [2023-12-02 13:42:43,140 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 13:42:43,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:42:43,149 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 2 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 13:42:43,172 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 13:42:43,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:43,214 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-02 13:42:43,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 71 [2023-12-02 13:42:43,235 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 13:42:43,235 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 13:42:43,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:43,246 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 13:42:43,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 43 [2023-12-02 13:42:43,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:43,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:42:43,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 13 [2023-12-02 13:42:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2023-12-02 13:42:43,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:42:44,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092878832] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:42:44,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [3128152] [2023-12-02 13:42:44,511 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 13:42:44,511 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:42:44,511 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:42:44,511 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:42:44,511 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:42:45,253 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 120 for LOIs [2023-12-02 13:42:45,400 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:42:49,516 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3257#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_sll_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) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 13:42:49,516 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:42:49,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:42:49,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 33 [2023-12-02 13:42:49,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131242719] [2023-12-02 13:42:49,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 13:42:49,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 13:42:49,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:42:49,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 13:42:49,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2898, Unknown=7, NotChecked=108, Total=3192 [2023-12-02 13:42:49,518 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 33 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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 13:42:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:42:50,462 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2023-12-02 13:42:50,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 13:42:50,463 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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 33 [2023-12-02 13:42:50,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:42:50,463 INFO L225 Difference]: With dead ends: 63 [2023-12-02 13:42:50,463 INFO L226 Difference]: Without dead ends: 48 [2023-12-02 13:42:50,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=258, Invalid=3645, Unknown=7, NotChecked=122, Total=4032 [2023-12-02 13:42:50,464 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:42:50,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 174 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 468 Invalid, 0 Unknown, 44 Unchecked, 0.4s Time] [2023-12-02 13:42:50,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-02 13:42:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2023-12-02 13:42:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 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 13:42:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2023-12-02 13:42:50,477 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 33 [2023-12-02 13:42:50,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:42:50,478 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-12-02 13:42:50,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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 13:42:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2023-12-02 13:42:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 13:42:50,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:42:50,478 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:42:50,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 13:42:50,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:42:50,679 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:42:50,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:42:50,679 INFO L85 PathProgramCache]: Analyzing trace with hash 456183763, now seen corresponding path program 4 times [2023-12-02 13:42:50,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:42:50,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779251352] [2023-12-02 13:42:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:42:50,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:42:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 13:42:52,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:42:52,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779251352] [2023-12-02 13:42:52,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779251352] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:42:52,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466113537] [2023-12-02 13:42:52,982 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 13:42:52,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:42:52,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:42:52,983 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:42:52,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 13:42:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:42:53,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 157 conjunts are in the unsatisfiable core [2023-12-02 13:42:53,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:42:53,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 13:42:53,473 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 13:42:53,481 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 13:42:53,580 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 13:42:53,584 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 13:42:53,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 13:42:53,792 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 13:42:53,793 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 13:42:53,816 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 13:42:53,816 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 13:42:53,847 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 13:42:53,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 13:42:53,992 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 22 [2023-12-02 13:42:54,005 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 27 treesize of output 15 [2023-12-02 13:42:54,278 INFO L349 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2023-12-02 13:42:54,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 56 [2023-12-02 13:42:54,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:54,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:54,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 13:42:54,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 13:42:54,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:54,516 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2023-12-02 13:42:54,517 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 124 treesize of output 80 [2023-12-02 13:42:54,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:54,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:54,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:54,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:54,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:54,547 INFO L349 Elim1Store]: treesize reduction 41, result has 26.8 percent of original size [2023-12-02 13:42:54,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 50 [2023-12-02 13:42:54,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:54,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:54,573 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-12-02 13:42:54,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-12-02 13:42:55,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:55,585 INFO L349 Elim1Store]: treesize reduction 236, result has 19.5 percent of original size [2023-12-02 13:42:55,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 143 treesize of output 114 [2023-12-02 13:42:55,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:55,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:55,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:55,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:55,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:42:55,657 INFO L349 Elim1Store]: treesize reduction 154, result has 23.4 percent of original size [2023-12-02 13:42:55,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 68 [2023-12-02 13:43:01,073 INFO L349 Elim1Store]: treesize reduction 207, result has 78.5 percent of original size [2023-12-02 13:43:01,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 22 new quantified variables, introduced 91 case distinctions, treesize of input 479 treesize of output 996 [2023-12-02 13:43:01,244 INFO L224 Elim1Store]: Index analysis took 106 ms [2023-12-02 13:43:04,585 INFO L349 Elim1Store]: treesize reduction 211, result has 77.3 percent of original size [2023-12-02 13:43:04,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 3 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 88 case distinctions, treesize of input 225 treesize of output 882 [2023-12-02 13:43:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 13:43:05,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:43:19,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466113537] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:43:19,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [846108952] [2023-12-02 13:43:19,121 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 13:43:19,121 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:43:19,122 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:43:19,122 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:43:19,122 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:43:19,927 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-12-02 13:43:20,074 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:43:36,010 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3657#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_sll_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) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 13:43:36,011 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:43:36,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:43:36,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2023-12-02 13:43:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294960492] [2023-12-02 13:43:36,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 13:43:36,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-02 13:43:36,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:36,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-02 13:43:36,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=5931, Unknown=10, NotChecked=0, Total=6162 [2023-12-02 13:43:36,013 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 52 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 43 states have internal predecessors, (55), 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 13:43:59,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:59,111 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2023-12-02 13:43:59,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-02 13:43:59,112 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 43 states have internal predecessors, (55), 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 35 [2023-12-02 13:43:59,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:59,113 INFO L225 Difference]: With dead ends: 75 [2023-12-02 13:43:59,113 INFO L226 Difference]: Without dead ends: 70 [2023-12-02 13:43:59,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 54.2s TimeCoverageRelationStatistics Valid=634, Invalid=13875, Unknown=11, NotChecked=0, Total=14520 [2023-12-02 13:43:59,115 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 146 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:59,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 320 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-02 13:43:59,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-02 13:43:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2023-12-02 13:43:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 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 13:43:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2023-12-02 13:43:59,139 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 35 [2023-12-02 13:43:59,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:59,140 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2023-12-02 13:43:59,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 43 states have internal predecessors, (55), 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 13:43:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2023-12-02 13:43:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 13:43:59,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:59,141 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:59,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 13:43:59,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 13:43:59,341 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:43:59,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:59,342 INFO L85 PathProgramCache]: Analyzing trace with hash 456239749, now seen corresponding path program 2 times [2023-12-02 13:43:59,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:59,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115184118] [2023-12-02 13:43:59,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:59,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 13:43:59,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:59,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115184118] [2023-12-02 13:43:59,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115184118] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:43:59,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259740719] [2023-12-02 13:43:59,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:43:59,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:43:59,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:43:59,470 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:43:59,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 13:43:59,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 13:43:59,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:43:59,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 13:43:59,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:43:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 13:43:59,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:43:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 13:43:59,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259740719] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:43:59,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [683032206] [2023-12-02 13:43:59,977 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-12-02 13:43:59,977 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:43:59,977 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:43:59,977 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:43:59,977 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:44:00,751 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 120 for LOIs [2023-12-02 13:44:00,900 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:44:04,420 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4154#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= |ULTIMATE.start_main_~count~0#1| 3)) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (= |ULTIMATE.start_sll_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) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 13:44:04,420 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:44:04,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:44:04,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-12-02 13:44:04,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152610503] [2023-12-02 13:44:04,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:44:04,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:44:04,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:04,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:44:04,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=670, Unknown=1, NotChecked=0, Total=756 [2023-12-02 13:44:04,422 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 13:44:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:04,537 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2023-12-02 13:44:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 13:44:04,537 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2023-12-02 13:44:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:04,538 INFO L225 Difference]: With dead ends: 78 [2023-12-02 13:44:04,538 INFO L226 Difference]: Without dead ends: 59 [2023-12-02 13:44:04,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=85, Invalid=670, Unknown=1, NotChecked=0, Total=756 [2023-12-02 13:44:04,539 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 46 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:04,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 120 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:44:04,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-02 13:44:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2023-12-02 13:44:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 13:44:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2023-12-02 13:44:04,558 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 35 [2023-12-02 13:44:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:04,558 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2023-12-02 13:44:04,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 13:44:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2023-12-02 13:44:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 13:44:04,559 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:04,559 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:04,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 13:44:04,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:44:04,759 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:44:04,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:04,760 INFO L85 PathProgramCache]: Analyzing trace with hash 658564170, now seen corresponding path program 3 times [2023-12-02 13:44:04,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:04,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204539342] [2023-12-02 13:44:04,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:04,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:04,836 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 13:44:04,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:04,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204539342] [2023-12-02 13:44:04,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204539342] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:44:04,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815289704] [2023-12-02 13:44:04,836 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 13:44:04,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:44:04,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:44:04,837 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:44:04,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 13:44:05,399 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 13:44:05,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:44:05,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 13:44:05,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:44:05,428 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 13:44:05,428 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:44:05,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815289704] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:05,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:44:05,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-12-02 13:44:05,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146213303] [2023-12-02 13:44:05,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:05,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:44:05,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:05,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:44:05,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:44:05,430 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 13:44:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:05,455 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2023-12-02 13:44:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:44:05,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2023-12-02 13:44:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:05,456 INFO L225 Difference]: With dead ends: 50 [2023-12-02 13:44:05,456 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 13:44:05,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:44:05,457 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:05,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:44:05,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 13:44:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 13:44:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:44:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 13:44:05,458 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2023-12-02 13:44:05,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:05,458 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 13:44:05,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 13:44:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 13:44:05,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 13:44:05,461 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 13:44:05,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 13:44:05,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 13:44:05,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 13:44:10,967 INFO L899 garLoopResultBuilder]: For program point L605-1(lines 605 607) no Hoare annotation was computed. [2023-12-02 13:44:10,968 INFO L895 garLoopResultBuilder]: At program point L605-3(lines 605 607) the Hoare annotation is: (let ((.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |#memory_$Pointer$.base| .cse3) 4))) (let ((.cse0 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4) 0)) (.cse1 (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= |ULTIMATE.start_sll_append_~data#1| 1)) (.cse4 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse7 (= (select |#valid| .cse3) 1)) (.cse8 (= (select (select |#memory_int| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) 1)) (.cse9 (= |ULTIMATE.start_sll_append_~last~0#1.offset| 0)) (.cse10 (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0))) (.cse11 (not (= .cse3 0))) (.cse12 (= |ULTIMATE.start_sll_append_~head#1.offset| 0)) (.cse13 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse14 (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| .cse6))) (.cse15 (= (select (select |#memory_$Pointer$.offset| .cse6) 4) 0)) (.cse16 (<= (+ .cse3 1) |#StackHeapBarrier|)) (.cse17 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4) 0)) (.cse18 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse19 (= (select (select |#memory_int| |ULTIMATE.start_sll_append_~last~0#1.base|) 0) 1)) (.cse20 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (.cse21 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse22 (= (select |#valid| .cse6) 1)) (.cse23 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse24 (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0)) (.cse25 (not (= .cse6 0))) (.cse26 (<= (+ .cse6 1) |#StackHeapBarrier|)) (.cse27 (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 2) |ULTIMATE.start_main_~#s~0#1.base|))) (or (and .cse0 .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| .cse3) 4) 0) .cse4 (= .cse3 |ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |#memory_int| .cse5) 0) 1) (= (select (select |#memory_$Pointer$.base| .cse6) 4) 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 (= (select (select |#memory_int| .cse3) 0) 1) .cse4 .cse7 .cse8 .cse9 (= |ULTIMATE.start_sll_append_~last~0#1.base| .cse6) .cse10 .cse11 .cse12 .cse13 (= .cse5 0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) 0)) 4) 0) .cse27))))) [2023-12-02 13:44:10,968 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 609) no Hoare annotation was computed. [2023-12-02 13:44:10,968 INFO L899 garLoopResultBuilder]: For program point L605-4(lines 605 607) no Hoare annotation was computed. [2023-12-02 13:44:10,968 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-12-02 13:44:10,968 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 611 633) no Hoare annotation was computed. [2023-12-02 13:44:10,970 INFO L895 garLoopResultBuilder]: At program point L618-2(lines 618 625) the Hoare annotation is: (let ((.cse67 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse13 (select .cse67 0))) (let ((.cse14 (select (select |#memory_$Pointer$.base| .cse13) 4)) (.cse48 (select .cse67 |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse61 (select (select |#memory_$Pointer$.base| .cse48) 4)) (.cse15 (select |#memory_$Pointer$.base| .cse14)) (.cse59 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse55 (select (select |#memory_$Pointer$.base| .cse59) 4)) (.cse49 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse60 (select .cse15 4)) (.cse16 (select (select |#memory_$Pointer$.offset| .cse13) 4)) (.cse66 (select (select |#memory_$Pointer$.base| .cse61) 4))) (let ((.cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) (.cse0 (<= (+ 2 .cse48) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= (select (select |#memory_$Pointer$.base| .cse66) 4) 0)) (.cse3 (= (select (select |#memory_$Pointer$.offset| .cse66) 4) 0)) (.cse4 (let ((.cse63 (= .cse66 0))) (or (and (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_70| Int)) (let ((.cse62 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_70|) 4))) (and (<= (+ 2 .cse62) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse62) 4) 0) (not (= .cse62 0)) (= |v_ULTIMATE.start_sll_append_~last~0#1.base_70| .cse62)))) .cse63) (and (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_70| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_70| Int)) (let ((.cse65 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_70| 4))) (let ((.cse64 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_70|) .cse65))) (and (not (= .cse64 .cse61)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_70|) .cse65) 0) (= (select (select |#memory_$Pointer$.offset| .cse64) 4) 0) (not (= .cse64 0)) (= (select (select |#memory_$Pointer$.base| .cse64) 4) 0) (<= (+ .cse64 2) |ULTIMATE.start_main_~#s~0#1.base|))))) .cse63) (and (<= (+ 2 .cse66) |ULTIMATE.start_main_~#s~0#1.base|) (not .cse63))))) (.cse6 (= (select (select |#memory_$Pointer$.offset| .cse61) 4) 0)) (.cse26 (<= (+ 2 .cse61) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse27 (= (select (select |#memory_$Pointer$.offset| .cse48) 4) 0)) (.cse28 (not (= .cse61 0))) (.cse29 (= .cse16 0)) (.cse12 (= (select (select |#memory_int| .cse13) 0) 1)) (.cse5 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse34 (= (select (select |#memory_$Pointer$.base| .cse60) 4) 0)) (.cse35 (<= (+ 2 .cse14) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (= |ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse19 (not (= .cse60 0))) (.cse8 (not (= .cse13 0))) (.cse24 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse36 (= (select (select |#memory_$Pointer$.offset| .cse14) 4) 0)) (.cse17 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse37 (<= (+ .cse13 2) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse9 (= (select (select |#memory_int| .cse14) 0) 1)) (.cse38 (<= (+ 2 .cse60) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse39 (= (select (select |#memory_$Pointer$.offset| .cse60) 4) 0)) (.cse10 (= (select .cse49 0) 0)) (.cse18 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse20 (= (select (select |#memory_int| .cse60) 0) 1)) (.cse25 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse40 (= (select (select |#memory_$Pointer$.offset| .cse59) 4) 0)) (.cse30 (= .cse55 0)) (.cse44 (not (= .cse14 0))) (.cse11 (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 0) 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or (and (or (and .cse8 .cse9 .cse10 .cse11) (and .cse12 (or (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 2) |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse13 |node_create_~temp~0#1.base|)) (not (= |node_create_~temp~0#1.base| .cse14)) (= (select (select |#memory_int| |node_create_~temp~0#1.base|) 0) 1))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse15 (+ .cse16 4)) 0) .cse10 .cse11)) .cse17 .cse18) (and .cse19 .cse8 .cse17 .cse10 .cse18 .cse20 .cse11)) (exists ((v_subst_65 Int) (v_subst_64 Int)) (let ((.cse23 (select (select |#memory_$Pointer$.base| v_subst_65) v_subst_64))) (let ((.cse22 (select (select |#memory_$Pointer$.base| .cse23) 4))) (let ((.cse21 (select (select |#memory_$Pointer$.base| .cse22) 4))) (and (= |ULTIMATE.start_main_~ptr~0#1.base| .cse21) (= (select (select |#memory_$Pointer$.offset| .cse22) 4) 0) (not (= .cse23 0)) (= (select (select |#memory_$Pointer$.offset| v_subst_65) v_subst_64) 0) (not (= .cse21 0)) (= (select (select |#memory_$Pointer$.base| .cse21) 4) 0) (<= (+ 2 .cse23) v_subst_65) (<= (+ 2 .cse22) v_subst_65) (= (select (select |#memory_$Pointer$.offset| .cse23) 4) 0) (not (= .cse22 0)) (<= (+ 2 .cse21) v_subst_65)))))) .cse24 .cse25 (= 2 |ULTIMATE.start_main_~count~0#1|) .cse26 .cse27 .cse28) (and .cse1 .cse29 (= |ULTIMATE.start_main_~count~0#1| 1) .cse30 (exists ((v_subst_21 Int)) (let ((.cse32 (select (select |#memory_$Pointer$.base| v_subst_21) 0))) (let ((.cse31 (select (select |#memory_$Pointer$.base| .cse32) 4))) (let ((.cse33 (select (select |#memory_$Pointer$.base| .cse31) 4))) (and (= |ULTIMATE.start_main_~ptr~0#1.base| .cse31) (not (= .cse32 0)) (<= (+ 2 .cse31) v_subst_21) (not (= .cse33 0)) (not (= .cse32 .cse33)) (not (= .cse31 .cse33)) (<= (+ 2 .cse33) v_subst_21) (not (= .cse32 .cse31))))))) .cse5 .cse34 .cse35 .cse7 .cse19 .cse8 .cse24 .cse36 .cse17 .cse37 .cse9 .cse38 .cse39 .cse10 .cse18 .cse20 .cse25 .cse40 (exists ((v_subst_47 Int) (v_subst_46 Int)) (let ((.cse43 (select (select |#memory_$Pointer$.base| v_subst_47) v_subst_46))) (let ((.cse41 (select (select |#memory_$Pointer$.base| .cse43) 4))) (let ((.cse42 (select (select |#memory_$Pointer$.base| .cse41) 4))) (and (not (= .cse41 0)) (<= (+ .cse42 2) v_subst_47) (<= (+ 2 .cse41) v_subst_47) (<= (+ 2 .cse43) v_subst_47) (= 0 (select (select |#memory_$Pointer$.offset| v_subst_47) v_subst_46)) (not (= .cse42 0)) (= (select (select |#memory_$Pointer$.offset| .cse43) 4) 0) (not (= .cse43 0)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse41)))))) .cse44 (exists ((v_subst_11 Int)) (let ((.cse47 (select (select |#memory_$Pointer$.base| v_subst_11) 0))) (let ((.cse46 (select (select |#memory_$Pointer$.base| .cse47) 4))) (let ((.cse45 (select (select |#memory_$Pointer$.base| .cse46) 4))) (and (not (= .cse45 .cse46)) (= (select (select |#memory_$Pointer$.offset| v_subst_11) 0) 0) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse46) (not (= .cse47 0)) (<= (+ .cse45 2) v_subst_11) (not (= .cse47 v_subst_11)) (not (= .cse45 .cse47)) (= (select (select |#memory_int| .cse45) 0) 1) (= (select (select |#memory_$Pointer$.offset| .cse47) 4) 0) (not (= .cse46 v_subst_11))))))) .cse11) (and .cse0 (not (= .cse48 0)) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~count~0#1| 3) (= (select .cse49 |ULTIMATE.start_main_~#s~0#1.offset|) 0) .cse6 .cse7 (= |ULTIMATE.start_main_~ptr~0#1.base| 0) .cse24 .cse17 .cse18 .cse25 .cse26 .cse27 .cse28) (and .cse29 .cse12 .cse5 (exists ((v_subst_5 Int)) (let ((.cse51 (select (select |#memory_$Pointer$.base| v_subst_5) 0))) (let ((.cse50 (select (select |#memory_$Pointer$.base| .cse51) 4))) (and (= (select (select |#memory_int| .cse50) 0) 1) (not (= .cse50 0)) (= (select (select |#memory_$Pointer$.offset| .cse51) 4) 0) (<= (+ 2 .cse51) v_subst_5) (not (= .cse50 .cse51)) (not (= .cse51 0)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse51) (not (= .cse50 v_subst_5)) (= (select (select |#memory_$Pointer$.offset| v_subst_5) 0) 0))))) .cse34 .cse35 .cse7 (= |ULTIMATE.start_main_~count~0#1| 0) .cse19 (exists ((v_subst_18 Int)) (let ((.cse54 (select (select |#memory_$Pointer$.base| v_subst_18) 0))) (let ((.cse52 (select (select |#memory_$Pointer$.base| .cse54) 4))) (let ((.cse53 (select (select |#memory_$Pointer$.base| .cse52) (+ (select (select |#memory_$Pointer$.offset| .cse54) 4) 4)))) (and (not (= .cse52 .cse53)) (not (= .cse54 0)) (<= (+ 2 .cse53) v_subst_18) (not (= .cse54 .cse53)) (<= (+ 2 .cse52) v_subst_18) (= .cse54 |ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |#memory_$Pointer$.offset| v_subst_18) 0) 0)))))) .cse8 .cse24 .cse36 (= (select (select |#memory_$Pointer$.offset| .cse55) 4) 0) .cse17 .cse37 .cse9 .cse38 .cse39 .cse10 .cse18 .cse20 .cse25 .cse40 (not .cse30) (= (select (select |#memory_$Pointer$.base| .cse55) 4) 0) .cse44 .cse11 (exists ((v_subst_8 Int)) (let ((.cse56 (select (select |#memory_$Pointer$.base| v_subst_8) 0))) (let ((.cse58 (select (select |#memory_$Pointer$.base| .cse56) 4))) (let ((.cse57 (select (select |#memory_$Pointer$.base| .cse58) (+ 4 (select (select |#memory_$Pointer$.offset| .cse56) 4))))) (and (not (= .cse56 .cse57)) (not (= .cse57 .cse58)) (not (= .cse58 v_subst_8)) (not (= .cse56 v_subst_8)) (<= (+ 2 .cse57) v_subst_8) (= (select (select |#memory_int| .cse57) 0) 1) (= (select (select |#memory_$Pointer$.offset| v_subst_8) 0) 0) (= .cse56 |ULTIMATE.start_main_~ptr~0#1.base|) (not (= .cse56 0))))))))))))))) [2023-12-02 13:44:10,970 INFO L899 garLoopResultBuilder]: For program point L618-3(lines 611 633) no Hoare annotation was computed. [2023-12-02 13:44:10,970 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse14 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))) (let ((.cse2 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse4 (not .cse14)) (.cse1 (= .cse0 0)) (.cse11 (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1)) (.cse12 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse13 (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)) (.cse3 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse6 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse9 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse10 (= |ULTIMATE.start_sll_create_~data#1| 1))) (or (and (= (select (select |#memory_int| .cse0) 0) 1) (not .cse1) .cse2 .cse3 .cse4 (= (select |#valid| .cse0) 1) (<= (+ .cse0 1) |#StackHeapBarrier|) .cse5 (<= |ULTIMATE.start_sll_create_~len#1| 0) .cse6 (= (select (select |#memory_$Pointer$.base| .cse0) 4) 0) .cse7 .cse8 .cse9 .cse10 .cse11 (= (select (select |#memory_$Pointer$.offset| .cse0) 4) 0) .cse12 .cse13) (and .cse2 .cse3 .cse4 .cse5 .cse1 .cse6 (= |ULTIMATE.start_sll_create_~len#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse3 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2023-12-02 13:44:10,970 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 631) no Hoare annotation was computed. [2023-12-02 13:44:10,970 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse2 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (.cse3 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |ULTIMATE.start_sll_create_~data#1| 1))) (or (and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse0 (not .cse1) .cse2 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) .cse3 (= |ULTIMATE.start_sll_create_~len#1| 1) .cse4 .cse5 .cse6 .cse7 (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7))) [2023-12-02 13:44:10,970 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-12-02 13:44:10,971 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 13:44:10,971 INFO L899 garLoopResultBuilder]: For program point L599(lines 599 610) no Hoare annotation was computed. [2023-12-02 13:44:10,971 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 622) no Hoare annotation was computed. [2023-12-02 13:44:10,971 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 13:44:10,971 INFO L895 garLoopResultBuilder]: At program point L600(line 600) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse0) 4))) (and (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_~data#1| 1) (= (select (select |#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |#memory_int| .cse0) 0) 1) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| .cse1) 4) 0) (= (select |#valid| .cse0) 1) (not (= .cse0 0)) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse1) 4) 0) (<= (+ .cse0 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_int| .cse1) 0) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| .cse1) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= .cse1 0)) (<= (+ .cse1 1) |#StackHeapBarrier|)))) [2023-12-02 13:44:10,971 INFO L899 garLoopResultBuilder]: For program point L600-1(line 600) no Hoare annotation was computed. [2023-12-02 13:44:10,971 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 611 633) no Hoare annotation was computed. [2023-12-02 13:44:10,971 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-02 13:44:10,971 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-02 13:44:10,971 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2023-12-02 13:44:10,972 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-12-02 13:44:10,974 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1] [2023-12-02 13:44:10,976 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 13:44:10,985 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head~0!base][4]][0] could not be translated [2023-12-02 13:44:10,986 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-12-02 13:44:10,986 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-02 13:44:10,986 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated [2023-12-02 13:44:10,987 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~head~0!base][4]] could not be translated [2023-12-02 13:44:10,987 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-12-02 13:44:10,987 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 13:44:10,987 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-12-02 13:44:10,988 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head~0!base][0] could not be translated [2023-12-02 13:44:10,988 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-12-02 13:44:10,988 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated [2023-12-02 13:44:10,988 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-02 13:44:10,988 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated [2023-12-02 13:44:10,988 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-12-02 13:44:10,988 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 13:44:10,989 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head~0!base][0] could not be translated [2023-12-02 13:44:10,989 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated [2023-12-02 13:44:10,989 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated [2023-12-02 13:44:10,989 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 13:44:10,992 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~new_last~0!base][4] could not be translated [2023-12-02 13:44:10,992 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 13:44:10,992 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 13:44:10,993 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated [2023-12-02 13:44:10,993 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated [2023-12-02 13:44:10,993 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated [2023-12-02 13:44:10,993 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~last~0!base][4]][0] could not be translated [2023-12-02 13:44:10,993 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-02 13:44:10,993 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~#s~0!base][0]] could not be translated [2023-12-02 13:44:10,993 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~new_last~0!base][0] could not be translated [2023-12-02 13:44:10,994 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated [2023-12-02 13:44:10,994 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 13:44:10,994 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 13:44:10,994 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated [2023-12-02 13:44:10,994 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-02 13:44:10,994 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated [2023-12-02 13:44:10,994 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~new_last~0!base][4] could not be translated [2023-12-02 13:44:10,994 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~last~0!base][0] could not be translated [2023-12-02 13:44:10,995 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#s~0!base][0] could not be translated [2023-12-02 13:44:10,995 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]] could not be translated [2023-12-02 13:44:10,995 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 13:44:10,995 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated [2023-12-02 13:44:10,995 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated [2023-12-02 13:44:10,995 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 13:44:10,995 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~new_last~0!base][4] could not be translated [2023-12-02 13:44:10,995 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 13:44:10,996 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 13:44:10,996 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~#s~0!base][0]][0] could not be translated [2023-12-02 13:44:10,996 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated [2023-12-02 13:44:10,996 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~#s~0!base][0]] could not be translated [2023-12-02 13:44:10,996 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~new_last~0!base][0] could not be translated [2023-12-02 13:44:10,996 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated [2023-12-02 13:44:10,997 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated [2023-12-02 13:44:10,997 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 13:44:10,997 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 13:44:10,997 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~last~0!base][4] could not be translated [2023-12-02 13:44:10,997 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated [2023-12-02 13:44:10,997 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-02 13:44:10,997 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated [2023-12-02 13:44:10,998 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~new_last~0!base][4] could not be translated [2023-12-02 13:44:10,998 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~last~0!base][0] could not be translated [2023-12-02 13:44:10,998 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#s~0!base][0] could not be translated [2023-12-02 13:44:10,998 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]] could not be translated [2023-12-02 13:44:10,998 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 13:44:10,998 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated [2023-12-02 13:44:10,998 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated [2023-12-02 13:44:10,998 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head!base][0]][4] could not be translated [2023-12-02 13:44:10,999 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 13:44:11,013 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-02 13:44:11,014 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~ptr~0!base][4] could not be translated [2023-12-02 13:44:11,014 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4]][4] could not be translated [2023-12-02 13:44:11,014 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4]][4] could not be translated [2023-12-02 13:44:11,015 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_append_~last~0#1.base_70 : int :: ((2 + #memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][4] <= ~#s~0!base && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][4]][4] == 0) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][4] == 0)) && v_ULTIMATE.start_sll_append_~last~0#1.base_70 == #memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][4]) could not be translated [2023-12-02 13:44:11,015 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated [2023-12-02 13:44:11,015 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_append_~last~0#1.offset_70 : int, v_ULTIMATE.start_sll_append_~last~0#1.base_70 : int :: ((((!(#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4] == #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]) && #memory_$Pointer$.offset[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4] == 0) && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4]][4] == 0) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4] == 0)) && #memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4]][4] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4] + 2 <= ~#s~0!base) could not be translated [2023-12-02 13:44:11,015 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated [2023-12-02 13:44:11,015 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated [2023-12-02 13:44:11,016 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated [2023-12-02 13:44:11,016 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated [2023-12-02 13:44:11,016 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated [2023-12-02 13:44:11,016 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated [2023-12-02 13:44:11,017 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][0] could not be translated [2023-12-02 13:44:11,017 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#s~0!base][0] could not be translated [2023-12-02 13:44:11,017 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~ptr~0!base][0] could not be translated [2023-12-02 13:44:11,017 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~#s~0!base][0]][0] could not be translated [2023-12-02 13:44:11,018 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists node_create_~temp~0#1.base : int :: ((node_create_~temp~0#1.base + 2 <= ~#s~0!base && !(#memory_$Pointer$.base[~#s~0!base][0] == node_create_~temp~0#1.base)) && !(node_create_~temp~0#1.base == #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4])) && #memory_int[node_create_~temp~0#1.base][0] == 1) could not be translated [2023-12-02 13:44:11,018 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][#memory_$Pointer$.offset[#memory_$Pointer$.base[~#s~0!base][0]][4] + 4] could not be translated [2023-12-02 13:44:11,018 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#s~0!base][0] could not be translated [2023-12-02 13:44:11,018 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~ptr~0!base][0] could not be translated [2023-12-02 13:44:11,019 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-02 13:44:11,019 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated [2023-12-02 13:44:11,019 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#s~0!base][0] could not be translated [2023-12-02 13:44:11,019 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4]][0] could not be translated [2023-12-02 13:44:11,020 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~ptr~0!base][0] could not be translated [2023-12-02 13:44:11,020 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_65 : int, v_subst_64 : int :: (((((((((~ptr~0!base == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_65][v_subst_64]][4]][4] && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_65][v_subst_64]][4]][4] == 0) && !(#memory_$Pointer$.base[v_subst_65][v_subst_64] == 0)) && #memory_$Pointer$.offset[v_subst_65][v_subst_64] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_65][v_subst_64]][4]][4] == 0)) && #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_65][v_subst_64]][4]][4]][4] == 0) && 2 + #memory_$Pointer$.base[v_subst_65][v_subst_64] <= v_subst_65) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_65][v_subst_64]][4] <= v_subst_65) && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_65][v_subst_64]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_65][v_subst_64]][4] == 0)) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_65][v_subst_64]][4]][4] <= v_subst_65) could not be translated [2023-12-02 13:44:11,020 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4] could not be translated [2023-12-02 13:44:11,020 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4] could not be translated [2023-12-02 13:44:11,021 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4] could not be translated [2023-12-02 13:44:11,021 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~ptr~0!base][4] could not be translated [2023-12-02 13:44:11,021 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated [2023-12-02 13:44:11,021 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~ptr~0!base][4]][4] could not be translated [2023-12-02 13:44:11,022 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_21 : int :: ((((((~ptr~0!base == #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_21][0]][4] && !(#memory_$Pointer$.base[v_subst_21][0] == 0)) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_21][0]][4] <= v_subst_21) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_21][0]][4]][4] == 0)) && !(#memory_$Pointer$.base[v_subst_21][0] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_21][0]][4]][4])) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_21][0]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_21][0]][4]][4])) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_21][0]][4]][4] <= v_subst_21) && !(#memory_$Pointer$.base[v_subst_21][0] == #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_21][0]][4])) could not be translated [2023-12-02 13:44:11,022 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated [2023-12-02 13:44:11,022 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4]][4] could not be translated [2023-12-02 13:44:11,022 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated [2023-12-02 13:44:11,022 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-02 13:44:11,023 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated [2023-12-02 13:44:11,023 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-02 13:44:11,023 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated [2023-12-02 13:44:11,023 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][0] could not be translated [2023-12-02 13:44:11,023 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-02 13:44:11,023 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4]][4] could not be translated [2023-12-02 13:44:11,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#s~0!base][0] could not be translated [2023-12-02 13:44:11,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4]][0] could not be translated [2023-12-02 13:44:11,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~ptr~0!base][4]][4] could not be translated [2023-12-02 13:44:11,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_47 : int, v_subst_46 : int :: (((((((!(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_47][v_subst_46]][4] == 0) && #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_47][v_subst_46]][4]][4] + 2 <= v_subst_47) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_47][v_subst_46]][4] <= v_subst_47) && 2 + #memory_$Pointer$.base[v_subst_47][v_subst_46] <= v_subst_47) && 0 == #memory_$Pointer$.offset[v_subst_47][v_subst_46]) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_47][v_subst_46]][4]][4] == 0)) && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_47][v_subst_46]][4] == 0) && !(#memory_$Pointer$.base[v_subst_47][v_subst_46] == 0)) && ~ptr~0!base == #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_47][v_subst_46]][4]) could not be translated [2023-12-02 13:44:11,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated [2023-12-02 13:44:11,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_11 : int :: ((((((((!(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_11][0]][4]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_11][0]][4]) && #memory_$Pointer$.offset[v_subst_11][0] == 0) && ~ptr~0!base == #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_11][0]][4]) && !(#memory_$Pointer$.base[v_subst_11][0] == 0)) && #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_11][0]][4]][4] + 2 <= v_subst_11) && !(#memory_$Pointer$.base[v_subst_11][0] == v_subst_11)) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_11][0]][4]][4] == #memory_$Pointer$.base[v_subst_11][0])) && #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_11][0]][4]][4]][0] == 1) && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_11][0]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_11][0]][4] == v_subst_11)) could not be translated [2023-12-02 13:44:11,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~ptr~0!base][0] could not be translated [2023-12-02 13:44:11,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-02 13:44:11,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-02 13:44:11,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4]][4] could not be translated [2023-12-02 13:44:11,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4]][4] could not be translated [2023-12-02 13:44:11,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_append_~last~0#1.base_70 : int :: ((2 + #memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][4] <= ~#s~0!base && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][4]][4] == 0) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][4] == 0)) && v_ULTIMATE.start_sll_append_~last~0#1.base_70 == #memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][4]) could not be translated [2023-12-02 13:44:11,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated [2023-12-02 13:44:11,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_append_~last~0#1.offset_70 : int, v_ULTIMATE.start_sll_append_~last~0#1.base_70 : int :: ((((!(#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4] == #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]) && #memory_$Pointer$.offset[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4] == 0) && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4]][4] == 0) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4] == 0)) && #memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4]][4] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4] + 2 <= ~#s~0!base) could not be translated [2023-12-02 13:44:11,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated [2023-12-02 13:44:11,026 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated [2023-12-02 13:44:11,026 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated [2023-12-02 13:44:11,026 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated [2023-12-02 13:44:11,026 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-12-02 13:44:11,026 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated [2023-12-02 13:44:11,027 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4] could not be translated [2023-12-02 13:44:11,027 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4] could not be translated [2023-12-02 13:44:11,027 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4] could not be translated [2023-12-02 13:44:11,027 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated [2023-12-02 13:44:11,027 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~#s~0!base][0]][0] could not be translated [2023-12-02 13:44:11,027 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated [2023-12-02 13:44:11,028 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_5 : int :: (((((((#memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_5][0]][4]][0] == 1 && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_5][0]][4] == 0)) && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_5][0]][4] == 0) && 2 + #memory_$Pointer$.base[v_subst_5][0] <= v_subst_5) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_5][0]][4] == #memory_$Pointer$.base[v_subst_5][0])) && !(#memory_$Pointer$.base[v_subst_5][0] == 0)) && ~ptr~0!base == #memory_$Pointer$.base[v_subst_5][0]) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_5][0]][4] == v_subst_5)) && #memory_$Pointer$.offset[v_subst_5][0] == 0) could not be translated [2023-12-02 13:44:11,028 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4]][4] could not be translated [2023-12-02 13:44:11,029 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated [2023-12-02 13:44:11,029 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-02 13:44:11,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_18 : int :: (((((!(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_18][0]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_18][0]][4]][#memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_18][0]][4] + 4]) && !(#memory_$Pointer$.base[v_subst_18][0] == 0)) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_18][0]][4]][#memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_18][0]][4] + 4] <= v_subst_18) && !(#memory_$Pointer$.base[v_subst_18][0] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_18][0]][4]][#memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_18][0]][4] + 4])) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_18][0]][4] <= v_subst_18) && #memory_$Pointer$.base[v_subst_18][0] == ~ptr~0!base) && #memory_$Pointer$.offset[v_subst_18][0] == 0) could not be translated [2023-12-02 13:44:11,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated [2023-12-02 13:44:11,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-02 13:44:11,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~ptr~0!base][4]][4]][4] could not be translated [2023-12-02 13:44:11,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated [2023-12-02 13:44:11,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][0] could not be translated [2023-12-02 13:44:11,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-02 13:44:11,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4]][4] could not be translated [2023-12-02 13:44:11,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#s~0!base][0] could not be translated [2023-12-02 13:44:11,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4]][0] could not be translated [2023-12-02 13:44:11,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~ptr~0!base][4]][4] could not be translated [2023-12-02 13:44:11,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~ptr~0!base][4]][4] could not be translated [2023-12-02 13:44:11,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~ptr~0!base][4]][4]][4] could not be translated [2023-12-02 13:44:11,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated [2023-12-02 13:44:11,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~ptr~0!base][0] could not be translated [2023-12-02 13:44:11,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_8 : int :: (((((((!(#memory_$Pointer$.base[v_subst_8][0] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_8][0]][4]][4 + #memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_8][0]][4]]) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_8][0]][4]][4 + #memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_8][0]][4]] == #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_8][0]][4])) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_8][0]][4] == v_subst_8)) && !(#memory_$Pointer$.base[v_subst_8][0] == v_subst_8)) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_8][0]][4]][4 + #memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_8][0]][4]] <= v_subst_8) && #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_8][0]][4]][4 + #memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_8][0]][4]]][0] == 1) && #memory_$Pointer$.offset[v_subst_8][0] == 0) && #memory_$Pointer$.base[v_subst_8][0] == ~ptr~0!base) && !(#memory_$Pointer$.base[v_subst_8][0] == 0)) could not be translated [2023-12-02 13:44:11,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:44:11 BoogieIcfgContainer [2023-12-02 13:44:11,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 13:44:11,032 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 13:44:11,032 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 13:44:11,032 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 13:44:11,033 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:40:09" (3/4) ... [2023-12-02 13:44:11,035 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 13:44:11,038 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-12-02 13:44:11,044 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2023-12-02 13:44:11,044 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-12-02 13:44:11,044 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-12-02 13:44:11,045 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 13:44:11,140 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 13:44:11,140 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 13:44:11,141 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 13:44:11,141 INFO L158 Benchmark]: Toolchain (without parser) took 242515.90ms. Allocated memory was 153.1MB in the beginning and 413.1MB in the end (delta: 260.0MB). Free memory was 121.7MB in the beginning and 179.9MB in the end (delta: -58.2MB). Peak memory consumption was 202.9MB. Max. memory is 16.1GB. [2023-12-02 13:44:11,142 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:44:11,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.44ms. Allocated memory is still 153.1MB. Free memory was 121.7MB in the beginning and 103.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 13:44:11,142 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.19ms. Allocated memory is still 153.1MB. Free memory was 103.8MB in the beginning and 101.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 13:44:11,143 INFO L158 Benchmark]: Boogie Preprocessor took 40.38ms. Allocated memory is still 153.1MB. Free memory was 101.7MB in the beginning and 100.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 13:44:11,143 INFO L158 Benchmark]: RCFGBuilder took 400.86ms. Allocated memory is still 153.1MB. Free memory was 100.0MB in the beginning and 82.0MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 13:44:11,143 INFO L158 Benchmark]: TraceAbstraction took 241474.11ms. Allocated memory was 153.1MB in the beginning and 413.1MB in the end (delta: 260.0MB). Free memory was 81.1MB in the beginning and 185.1MB in the end (delta: -104.0MB). Peak memory consumption was 229.0MB. Max. memory is 16.1GB. [2023-12-02 13:44:11,144 INFO L158 Benchmark]: Witness Printer took 108.35ms. Allocated memory is still 413.1MB. Free memory was 185.1MB in the beginning and 179.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 13:44:11,145 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.44ms. Allocated memory is still 153.1MB. Free memory was 121.7MB in the beginning and 103.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.19ms. Allocated memory is still 153.1MB. Free memory was 103.8MB in the beginning and 101.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.38ms. Allocated memory is still 153.1MB. Free memory was 101.7MB in the beginning and 100.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 400.86ms. Allocated memory is still 153.1MB. Free memory was 100.0MB in the beginning and 82.0MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 241474.11ms. Allocated memory was 153.1MB in the beginning and 413.1MB in the end (delta: 260.0MB). Free memory was 81.1MB in the beginning and 185.1MB in the end (delta: -104.0MB). Peak memory consumption was 229.0MB. Max. memory is 16.1GB. * Witness Printer took 108.35ms. Allocated memory is still 413.1MB. Free memory was 185.1MB in the beginning and 179.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head~0!base][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~new_last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~last~0!base][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~#s~0!base][0]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~new_last~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~new_last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~last~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~new_last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~#s~0!base][0]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~new_last~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~new_last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~last~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~ptr~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_append_~last~0#1.base_70 : int :: ((2 + #memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][4] <= ~#s~0!base && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][4]][4] == 0) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][4] == 0)) && v_ULTIMATE.start_sll_append_~last~0#1.base_70 == #memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][4]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_append_~last~0#1.offset_70 : int, v_ULTIMATE.start_sll_append_~last~0#1.base_70 : int :: ((((!(#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4] == #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]) && #memory_$Pointer$.offset[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4] == 0) && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4]][4] == 0) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4] == 0)) && #memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4]][4] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4] + 2 <= ~#s~0!base) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~ptr~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists node_create_~temp~0#1.base : int :: ((node_create_~temp~0#1.base + 2 <= ~#s~0!base && !(#memory_$Pointer$.base[~#s~0!base][0] == node_create_~temp~0#1.base)) && !(node_create_~temp~0#1.base == #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4])) && #memory_int[node_create_~temp~0#1.base][0] == 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][#memory_$Pointer$.offset[#memory_$Pointer$.base[~#s~0!base][0]][4] + 4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~ptr~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~ptr~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_65 : int, v_subst_64 : int :: (((((((((~ptr~0!base == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_65][v_subst_64]][4]][4] && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_65][v_subst_64]][4]][4] == 0) && !(#memory_$Pointer$.base[v_subst_65][v_subst_64] == 0)) && #memory_$Pointer$.offset[v_subst_65][v_subst_64] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_65][v_subst_64]][4]][4] == 0)) && #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_65][v_subst_64]][4]][4]][4] == 0) && 2 + #memory_$Pointer$.base[v_subst_65][v_subst_64] <= v_subst_65) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_65][v_subst_64]][4] <= v_subst_65) && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_65][v_subst_64]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_65][v_subst_64]][4] == 0)) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_65][v_subst_64]][4]][4] <= v_subst_65) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~ptr~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~ptr~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_21 : int :: ((((((~ptr~0!base == #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_21][0]][4] && !(#memory_$Pointer$.base[v_subst_21][0] == 0)) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_21][0]][4] <= v_subst_21) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_21][0]][4]][4] == 0)) && !(#memory_$Pointer$.base[v_subst_21][0] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_21][0]][4]][4])) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_21][0]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_21][0]][4]][4])) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_21][0]][4]][4] <= v_subst_21) && !(#memory_$Pointer$.base[v_subst_21][0] == #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_21][0]][4])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~ptr~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_47 : int, v_subst_46 : int :: (((((((!(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_47][v_subst_46]][4] == 0) && #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_47][v_subst_46]][4]][4] + 2 <= v_subst_47) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_47][v_subst_46]][4] <= v_subst_47) && 2 + #memory_$Pointer$.base[v_subst_47][v_subst_46] <= v_subst_47) && 0 == #memory_$Pointer$.offset[v_subst_47][v_subst_46]) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_47][v_subst_46]][4]][4] == 0)) && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_47][v_subst_46]][4] == 0) && !(#memory_$Pointer$.base[v_subst_47][v_subst_46] == 0)) && ~ptr~0!base == #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_47][v_subst_46]][4]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_11 : int :: ((((((((!(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_11][0]][4]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_11][0]][4]) && #memory_$Pointer$.offset[v_subst_11][0] == 0) && ~ptr~0!base == #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_11][0]][4]) && !(#memory_$Pointer$.base[v_subst_11][0] == 0)) && #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_11][0]][4]][4] + 2 <= v_subst_11) && !(#memory_$Pointer$.base[v_subst_11][0] == v_subst_11)) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_11][0]][4]][4] == #memory_$Pointer$.base[v_subst_11][0])) && #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_11][0]][4]][4]][0] == 1) && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_11][0]][4] == 0) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_11][0]][4] == v_subst_11)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~ptr~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_append_~last~0#1.base_70 : int :: ((2 + #memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][4] <= ~#s~0!base && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][4]][4] == 0) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][4] == 0)) && v_ULTIMATE.start_sll_append_~last~0#1.base_70 == #memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][4]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_append_~last~0#1.offset_70 : int, v_ULTIMATE.start_sll_append_~last~0#1.base_70 : int :: ((((!(#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4] == #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]) && #memory_$Pointer$.offset[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4] == 0) && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4]][4] == 0) && !(#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4] == 0)) && #memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4]][4] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_sll_append_~last~0#1.base_70][v_ULTIMATE.start_sll_append_~last~0#1.offset_70 + 4] + 2 <= ~#s~0!base) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][~#s~0!offset]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_5 : int :: (((((((#memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_5][0]][4]][0] == 1 && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_5][0]][4] == 0)) && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_5][0]][4] == 0) && 2 + #memory_$Pointer$.base[v_subst_5][0] <= v_subst_5) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_5][0]][4] == #memory_$Pointer$.base[v_subst_5][0])) && !(#memory_$Pointer$.base[v_subst_5][0] == 0)) && ~ptr~0!base == #memory_$Pointer$.base[v_subst_5][0]) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_5][0]][4] == v_subst_5)) && #memory_$Pointer$.offset[v_subst_5][0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_18 : int :: (((((!(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_18][0]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_18][0]][4]][#memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_18][0]][4] + 4]) && !(#memory_$Pointer$.base[v_subst_18][0] == 0)) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_18][0]][4]][#memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_18][0]][4] + 4] <= v_subst_18) && !(#memory_$Pointer$.base[v_subst_18][0] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_18][0]][4]][#memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_18][0]][4] + 4])) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_18][0]][4] <= v_subst_18) && #memory_$Pointer$.base[v_subst_18][0] == ~ptr~0!base) && #memory_$Pointer$.offset[v_subst_18][0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~ptr~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~ptr~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~ptr~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~ptr~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~ptr~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_8 : int :: (((((((!(#memory_$Pointer$.base[v_subst_8][0] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_8][0]][4]][4 + #memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_8][0]][4]]) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_8][0]][4]][4 + #memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_8][0]][4]] == #memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_8][0]][4])) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_8][0]][4] == v_subst_8)) && !(#memory_$Pointer$.base[v_subst_8][0] == v_subst_8)) && 2 + #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_8][0]][4]][4 + #memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_8][0]][4]] <= v_subst_8) && #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_subst_8][0]][4]][4 + #memory_$Pointer$.offset[#memory_$Pointer$.base[v_subst_8][0]][4]]][0] == 1) && #memory_$Pointer$.offset[v_subst_8][0] == 0) && #memory_$Pointer$.base[v_subst_8][0] == ~ptr~0!base) && !(#memory_$Pointer$.base[v_subst_8][0] == 0)) could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 631]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 241.4s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 49.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 801 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 797 mSDsluCounter, 2599 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 265 IncrementalHoareTripleChecker+Unchecked, 2403 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8025 IncrementalHoareTripleChecker+Invalid, 8405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 196 mSDtfsCounter, 8025 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1339 GetRequests, 491 SyntacticMatches, 2 SemanticMatches, 846 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 14912 ImplicationChecksByTransitivity, 177.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=13, InterpolantAutomatonStates: 273, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 126 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 26 NumberOfFragments, 3170 HoareAnnotationTreeSize, 13 FomulaSimplifications, 27254 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2716 FormulaSimplificationTreeSizeReductionInter, 5.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 68.4s InterpolantComputationTime, 820 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 843 ConstructedInterpolants, 29 QuantifiedInterpolants, 23243 SizeOfPredicates, 248 NumberOfNonLiveVariables, 4339 ConjunctsInSsa, 1199 ConjunctsInUnsatCore, 30 InterpolantComputations, 4 PerfectInterpolantSequences, 299/553 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((len <= 0) && (data == 1)) && (len == 2)) && (data == 1)) || ((((len == 1) && (data == 1)) && (len == 2)) && (data == 1))) || ((((2 == len) && (data == 1)) && (len == 2)) && (data == 1))) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (((data == 1) && (data == 1)) || ((data == 1) && (data == 1))) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((((data == 1) || (data == 1)) && (len == 2)) && (2 == count)) || (((count == 1) && (data == 1)) && (len == 2))) || (((count == 3) && (data == 1)) && (len == 2))) || (((count == 0) && (data == 1)) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2023-12-02 13:44:11,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3970246-4732-41b3-8033-df08ab8c206e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE