./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2 --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 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 12:25:18,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 12:25:18,861 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-02 12:25:18,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 12:25:18,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 12:25:18,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 12:25:18,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 12:25:18,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 12:25:18,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 12:25:18,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 12:25:18,924 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 12:25:18,924 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 12:25:18,925 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 12:25:18,928 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 12:25:18,928 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 12:25:18,929 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 12:25:18,929 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 12:25:18,929 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 12:25:18,930 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 12:25:18,930 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 12:25:18,930 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 12:25:18,931 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 12:25:18,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 12:25:18,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-02 12:25:18,932 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 12:25:18,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 12:25:18,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 12:25:18,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 12:25:18,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-02 12:25:18,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 12:25:18,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-02 12:25:18,945 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 12:25:18,945 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 12:25:18,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-02 12:25:18,945 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 12:25:18,946 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 12:25:18,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 12:25:18,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 12:25:18,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:25:18,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 12:25:18,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 12:25:18,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-02 12:25:18,949 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 12:25:18,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 12:25:18,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 12:25:18,950 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 12:25:18,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 12:25:18,950 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_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/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_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2 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 -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2024-11-02 12:25:19,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 12:25:19,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 12:25:19,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 12:25:19,308 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 12:25:19,309 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 12:25:19,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i Unable to find full path for "g++" [2024-11-02 12:25:21,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 12:25:22,007 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 12:25:22,007 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2024-11-02 12:25:22,025 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/data/bcb7e64f4/b6fddb4eb54d4938868942e153774bb6/FLAG4ace0325a [2024-11-02 12:25:22,332 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/data/bcb7e64f4/b6fddb4eb54d4938868942e153774bb6 [2024-11-02 12:25:22,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 12:25:22,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 12:25:22,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 12:25:22,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 12:25:22,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 12:25:22,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:25:22" (1/1) ... [2024-11-02 12:25:22,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f46b0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:22, skipping insertion in model container [2024-11-02 12:25:22,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:25:22" (1/1) ... [2024-11-02 12:25:22,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 12:25:22,825 WARN L251 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_c0fd7529-151f-4d15-87a8-2dea316a233b/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2024-11-02 12:25:22,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:25:22,843 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 12:25:22,908 WARN L251 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_c0fd7529-151f-4d15-87a8-2dea316a233b/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2024-11-02 12:25:22,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:25:22,953 INFO L204 MainTranslator]: Completed translation [2024-11-02 12:25:22,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:22 WrapperNode [2024-11-02 12:25:22,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 12:25:22,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 12:25:22,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 12:25:22,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 12:25:22,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:22" (1/1) ... [2024-11-02 12:25:22,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:22" (1/1) ... [2024-11-02 12:25:23,004 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2024-11-02 12:25:23,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 12:25:23,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 12:25:23,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 12:25:23,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 12:25:23,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:22" (1/1) ... [2024-11-02 12:25:23,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:22" (1/1) ... [2024-11-02 12:25:23,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:22" (1/1) ... [2024-11-02 12:25:23,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:22" (1/1) ... [2024-11-02 12:25:23,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:22" (1/1) ... [2024-11-02 12:25:23,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:22" (1/1) ... [2024-11-02 12:25:23,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:22" (1/1) ... [2024-11-02 12:25:23,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:22" (1/1) ... [2024-11-02 12:25:23,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 12:25:23,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 12:25:23,044 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 12:25:23,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 12:25:23,045 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:22" (1/1) ... [2024-11-02 12:25:23,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:25:23,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:25:23,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 12:25:23,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 12:25:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-02 12:25:23,123 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-02 12:25:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-02 12:25:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-02 12:25:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-02 12:25:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 12:25:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-02 12:25:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-02 12:25:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-02 12:25:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-02 12:25:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 12:25:23,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 12:25:23,310 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 12:25:23,313 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 12:25:23,342 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-02 12:25:23,528 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-02 12:25:23,528 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 12:25:23,579 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 12:25:23,579 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-02 12:25:23,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:25:23 BoogieIcfgContainer [2024-11-02 12:25:23,580 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 12:25:23,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 12:25:23,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 12:25:23,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 12:25:23,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:25:22" (1/3) ... [2024-11-02 12:25:23,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183648c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:25:23, skipping insertion in model container [2024-11-02 12:25:23,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:22" (2/3) ... [2024-11-02 12:25:23,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183648c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:25:23, skipping insertion in model container [2024-11-02 12:25:23,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:25:23" (3/3) ... [2024-11-02 12:25:23,590 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2024-11-02 12:25:23,623 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 12:25:23,624 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-02 12:25:23,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 12:25:23,717 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@61c8981c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 12:25:23,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-02 12:25:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:25:23,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-02 12:25:23,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:23,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:25:23,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:25:23,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:23,736 INFO L85 PathProgramCache]: Analyzing trace with hash 545307248, now seen corresponding path program 1 times [2024-11-02 12:25:23,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:23,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384089417] [2024-11-02 12:25:23,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:23,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:25:24,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:24,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384089417] [2024-11-02 12:25:24,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384089417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:25:24,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:25:24,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 12:25:24,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685482588] [2024-11-02 12:25:24,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:25:24,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:25:24,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:24,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:25:24,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:25:24,111 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) [2024-11-02 12:25:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:24,171 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2024-11-02 12:25:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:25:24,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2024-11-02 12:25:24,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:24,183 INFO L225 Difference]: With dead ends: 38 [2024-11-02 12:25:24,183 INFO L226 Difference]: Without dead ends: 18 [2024-11-02 12:25:24,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:25:24,191 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:24,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:25:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-02 12:25:24,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-11-02 12:25:24,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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) [2024-11-02 12:25:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-02 12:25:24,229 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 7 [2024-11-02 12:25:24,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:24,230 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-02 12:25:24,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) [2024-11-02 12:25:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-11-02 12:25:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-02 12:25:24,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:24,231 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:25:24,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 12:25:24,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:25:24,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash 76022282, now seen corresponding path program 1 times [2024-11-02 12:25:24,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:24,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590755889] [2024-11-02 12:25:24,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:24,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:25:24,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:24,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590755889] [2024-11-02 12:25:24,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590755889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:25:24,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505229392] [2024-11-02 12:25:24,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:24,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:25:24,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:25:24,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:25:24,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-02 12:25:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:24,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 12:25:24,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:25:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:25:24,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:25:24,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:25:24,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505229392] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 12:25:24,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [597494835] [2024-11-02 12:25:24,864 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2024-11-02 12:25:24,864 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 12:25:24,869 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 12:25:24,875 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 12:25:24,876 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 12:25:26,552 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 12:25:26,650 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (<= 1 |c_#StackHeapBarrier|)) (.cse2 (= |c_ULTIMATE.start_main_~len~0#1| 5)) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~data_init~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse7 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))) (or (and (exists ((|v_#memory_int_5| (Array Int (Array Int Int))) (|v_#memory_int_34| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_#memory_int_5| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse1 (select |v_#memory_int_34| 1))) (and (= (store |v_#memory_int_5| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store .cse0 4 1)) |c_#memory_int|) (= (select .cse1 1) 0) (= (store |v_#memory_int_34| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |v_#memory_int_34| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 (select .cse0 0))) |v_#memory_int_5|) (= (select .cse1 0) 48)))) (exists ((|v_#memory_$Pointer$.base_27| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_27| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_27| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4))) |c_#memory_$Pointer$.base|)) .cse2 .cse3 (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) (exists ((|v_#length_11| (Array Int Int))) (and (= |c_#length| (store |v_#length_11| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 8)) (= (select |v_#length_11| 2) 27) (= 2 (select |v_#length_11| 1)))) .cse4 (<= (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_27| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_27| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_27| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4))))) .cse5 .cse6 .cse7 (= |c_ULTIMATE.start_sll_circular_create_~len#1| 5) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (exists ((|v_#valid_23| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_23| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 1)) (= (select |v_#valid_23| 1) 1) (= (select |v_#valid_23| 0) 0) (= (select |v_#valid_23| 2) 1) (= (select |v_#valid_23| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0)))) (let ((.cse9 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (exists ((|v_#memory_int_9| (Array Int (Array Int Int))) (|v_#memory_int_38| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_#memory_int_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (= |c_#memory_int| (store |v_#memory_int_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse8 .cse9 |c_ULTIMATE.start_sll_circular_create_~data#1|))) (= (store |v_#memory_int_38| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select |v_#memory_int_38| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select .cse8 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) |v_#memory_int_9|)))) (exists ((|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_22| Int)) (let ((.cse10 (= |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_22| 0))) (and (or (and .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 (<= |c_ULTIMATE.start_sll_circular_create_~len#1| 3) .cse7) (and .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7 (<= |c_ULTIMATE.start_sll_circular_create_~len#1| 4))) (or (and .cse2 .cse3 (= |c_ULTIMATE.start_sll_circular_create_~len#1| 3) .cse10 .cse5 .cse6 .cse7) (and .cse2 .cse3 .cse10 .cse5 .cse6 .cse7)) (= (store |v_#memory_$Pointer$.offset_31| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_31| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_22|) .cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse9))) |c_#memory_$Pointer$.offset|)))) (exists ((|v_#memory_$Pointer$.base_31| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~head~0#1.base_22| Int)) (= (store |v_#memory_$Pointer$.base_31| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (store (select |v_#memory_$Pointer$.base_31| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~head~0#1.base_22|) .cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse9))) |c_#memory_$Pointer$.base|)))))) is different from true [2024-11-02 12:25:27,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [597494835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:25:27,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-02 12:25:27,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 12 [2024-11-02 12:25:27,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481228734] [2024-11-02 12:25:27,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:25:27,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-02 12:25:27,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:27,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-02 12:25:27,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=94, Unknown=1, NotChecked=20, Total=156 [2024-11-02 12:25:27,776 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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) [2024-11-02 12:25:30,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-02 12:25:30,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:30,581 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2024-11-02 12:25:30,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 12:25:30,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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) Word has length 10 [2024-11-02 12:25:30,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:30,582 INFO L225 Difference]: With dead ends: 20 [2024-11-02 12:25:30,582 INFO L226 Difference]: Without dead ends: 18 [2024-11-02 12:25:30,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=49, Invalid=110, Unknown=1, NotChecked=22, Total=182 [2024-11-02 12:25:30,584 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:30,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 26 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 1 Unknown, 28 Unchecked, 2.6s Time] [2024-11-02 12:25:30,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-02 12:25:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-02 12:25:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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) [2024-11-02 12:25:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-02 12:25:30,593 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 10 [2024-11-02 12:25:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:30,594 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-02 12:25:30,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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) [2024-11-02 12:25:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-02 12:25:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-02 12:25:30,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:30,595 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:25:30,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-02 12:25:30,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:25:30,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:25:30,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:30,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1332973642, now seen corresponding path program 1 times [2024-11-02 12:25:30,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:30,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969786490] [2024-11-02 12:25:30,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:30,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:30,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-02 12:25:30,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:30,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969786490] [2024-11-02 12:25:30,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969786490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:25:30,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237212072] [2024-11-02 12:25:30,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:30,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:25:30,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:25:30,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:25:30,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-02 12:25:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:31,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 12:25:31,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:25:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-02 12:25:31,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:25:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-02 12:25:31,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237212072] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 12:25:31,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1591066967] [2024-11-02 12:25:31,165 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-02 12:25:31,165 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 12:25:31,166 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 12:25:31,166 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 12:25:31,166 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 12:25:32,395 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 12:25:38,207 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '294#(exists ((|v_ULTIMATE.start_main_~data_init~0#1_11| Int) (|v_ULTIMATE.start_main_#t~mem7#1_20| Int)) (and (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_main_~data_new~0#1|) (= |ULTIMATE.start_main_~len~0#1| 5) (not (= |v_ULTIMATE.start_main_#t~mem7#1_20| 1)) (= |v_ULTIMATE.start_main_~data_init~0#1_11| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |v_ULTIMATE.start_main_#t~mem7#1_20|) (= |ULTIMATE.start_main_~head~1#1.offset| 0)))' at error location [2024-11-02 12:25:38,208 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-02 12:25:38,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 12:25:38,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-02 12:25:38,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718664683] [2024-11-02 12:25:38,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 12:25:38,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 12:25:38,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:38,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 12:25:38,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=161, Unknown=3, NotChecked=0, Total=210 [2024-11-02 12:25:38,210 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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) [2024-11-02 12:25:38,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:38,267 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-02 12:25:38,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 12:25:38,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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) Word has length 13 [2024-11-02 12:25:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:38,270 INFO L225 Difference]: With dead ends: 38 [2024-11-02 12:25:38,270 INFO L226 Difference]: Without dead ends: 27 [2024-11-02 12:25:38,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=46, Invalid=161, Unknown=3, NotChecked=0, Total=210 [2024-11-02 12:25:38,272 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:38,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 36 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:25:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-02 12:25:38,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-02 12:25:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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) [2024-11-02 12:25:38,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-02 12:25:38,295 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 13 [2024-11-02 12:25:38,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:38,296 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-02 12:25:38,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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) [2024-11-02 12:25:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-02 12:25:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-02 12:25:38,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:38,299 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:25:38,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-02 12:25:38,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:25:38,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:25:38,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:38,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1756795556, now seen corresponding path program 2 times [2024-11-02 12:25:38,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:38,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236723785] [2024-11-02 12:25:38,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:38,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-02 12:25:40,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:40,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236723785] [2024-11-02 12:25:40,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236723785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:25:40,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568425041] [2024-11-02 12:25:40,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-02 12:25:40,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:25:40,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:25:40,870 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:25:40,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-02 12:25:41,068 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-02 12:25:41,069 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-02 12:25:41,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-02 12:25:41,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:25:41,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-02 12:25:41,563 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 18 treesize of output 7 [2024-11-02 12:25:41,592 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 22 treesize of output 1 [2024-11-02 12:25:41,637 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-02 12:25:41,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-02 12:25:41,791 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-02 12:25:41,792 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 31 treesize of output 30 [2024-11-02 12:25:41,806 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 [2024-11-02 12:25:41,826 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-02 12:25:41,827 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 19 treesize of output 18 [2024-11-02 12:25:42,115 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-02 12:25:42,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 37 [2024-11-02 12:25:42,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:25:42,137 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 42 treesize of output 34 [2024-11-02 12:25:42,162 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-02 12:25:42,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2024-11-02 12:25:42,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:25:42,194 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 30 treesize of output 30 [2024-11-02 12:25:42,229 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-02 12:25:42,229 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 27 treesize of output 26 [2024-11-02 12:25:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-02 12:25:42,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:25:42,791 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_310 (Array Int Int)) (v_ArrVal_303 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_310) .cse0) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_310 (Array Int Int)) (v_ArrVal_303 Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_310) .cse0) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) is different from false [2024-11-02 12:25:42,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:25:42,834 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 139 treesize of output 143 [2024-11-02 12:25:49,416 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (and (or (and (or .cse0 (forall ((v_ArrVal_298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_310 (Array Int Int)) (v_ArrVal_303 Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_310 (Array Int Int)) (v_ArrVal_303 Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse2) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (v_prenex_9 Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_7) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| v_prenex_7 (store (select |c_#memory_int| v_prenex_7) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_9)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse0 .cse2) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (v_ArrVal_298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_9 Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select (store (store |c_#memory_int| v_prenex_7 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_7) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_9)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse0))) is different from false [2024-11-02 12:25:49,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:25:49,465 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2024-11-02 12:25:49,469 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-02 12:25:49,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:25:49,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 63 [2024-11-02 12:25:49,496 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 48 treesize of output 44 [2024-11-02 12:25:49,563 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 41 treesize of output 29 [2024-11-02 12:25:49,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:25:49,599 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 43 treesize of output 34 [2024-11-02 12:25:49,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:25:49,630 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 95 treesize of output 97 [2024-11-02 12:25:49,643 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-02 12:25:49,651 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 48 treesize of output 44 [2024-11-02 12:25:49,672 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 74 treesize of output 66 [2024-11-02 12:25:49,732 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 8 treesize of output 4 [2024-11-02 12:25:49,792 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-02 12:25:49,793 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2024-11-02 12:25:49,809 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 48 treesize of output 36 [2024-11-02 12:25:49,819 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 11 treesize of output 7 [2024-11-02 12:25:49,845 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-02 12:25:49,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:25:49,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2024-11-02 12:25:49,869 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-02 12:25:49,875 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 16 treesize of output 8 [2024-11-02 12:25:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 7 not checked. [2024-11-02 12:25:50,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568425041] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 12:25:50,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [844790032] [2024-11-02 12:25:50,074 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-02 12:25:50,074 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 12:25:50,074 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 12:25:50,075 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 12:25:50,075 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 12:25:51,226 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 12:25:51,951 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '542#(exists ((|v_ULTIMATE.start_main_~data_init~0#1_13| Int) (|v_ULTIMATE.start_main_#t~mem7#1_28| Int)) (and (<= 1 |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_#t~mem7#1_28| 1)) (<= 1 |ULTIMATE.start_main_~data_new~0#1|) (= |ULTIMATE.start_main_~len~0#1| 5) (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |v_ULTIMATE.start_main_#t~mem7#1_28|) (= |ULTIMATE.start_main_~head~1#1.offset| 0) (= |v_ULTIMATE.start_main_~data_init~0#1_13| 1)))' at error location [2024-11-02 12:25:51,951 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-02 12:25:51,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 12:25:51,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 29 [2024-11-02 12:25:51,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617191403] [2024-11-02 12:25:51,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 12:25:51,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-02 12:25:51,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:51,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-02 12:25:51,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1143, Unknown=9, NotChecked=138, Total=1406 [2024-11-02 12:25:51,954 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 30 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 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) [2024-11-02 12:25:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:53,700 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-11-02 12:25:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-02 12:25:53,701 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 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) Word has length 22 [2024-11-02 12:25:53,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:53,702 INFO L225 Difference]: With dead ends: 41 [2024-11-02 12:25:53,703 INFO L226 Difference]: Without dead ends: 39 [2024-11-02 12:25:53,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=256, Invalid=1905, Unknown=9, NotChecked=182, Total=2352 [2024-11-02 12:25:53,706 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:53,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 350 Invalid, 0 Unknown, 62 Unchecked, 0.7s Time] [2024-11-02 12:25:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-02 12:25:53,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2024-11-02 12:25:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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) [2024-11-02 12:25:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-02 12:25:53,727 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2024-11-02 12:25:53,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:53,727 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-02 12:25:53,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 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) [2024-11-02 12:25:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-02 12:25:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-02 12:25:53,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:53,730 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:25:53,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-02 12:25:53,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:25:53,936 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:25:53,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:53,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1375297979, now seen corresponding path program 1 times [2024-11-02 12:25:53,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:53,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197704576] [2024-11-02 12:25:53,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:53,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-02 12:25:54,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:54,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197704576] [2024-11-02 12:25:54,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197704576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:25:54,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58435357] [2024-11-02 12:25:54,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:54,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:25:54,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:25:54,725 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:25:54,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fd7529-151f-4d15-87a8-2dea316a233b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-02 12:25:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:54,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-02 12:25:54,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:25:54,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-02 12:25:54,922 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-02 12:25:54,922 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 19 treesize of output 16 [2024-11-02 12:25:54,961 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-02 12:25:54,961 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 19 treesize of output 16 [2024-11-02 12:25:54,993 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-02 12:25:54,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-02 12:25:55,041 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-02 12:25:55,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-02 12:25:55,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2024-11-02 12:25:55,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-02 12:25:55,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-02 12:25:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-02 12:25:55,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:25:55,201 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-02 12:25:55,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:25:55,217 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 2 case distinctions, treesize of input 24 treesize of output 30 [2024-11-02 12:25:55,221 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 33 treesize of output 25 [2024-11-02 12:25:55,226 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 6 treesize of output 4