./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 23:28:12,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:28:12,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:28:12,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:28:12,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:28:12,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:28:12,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:28:12,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:28:12,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:28:12,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:28:12,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:28:12,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:28:12,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:28:12,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:28:12,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:28:12,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:28:12,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:28:12,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:28:12,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:28:12,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:28:12,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:28:12,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:28:12,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:28:12,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:28:12,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:28:12,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:28:12,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:28:12,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:28:12,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:28:12,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:28:12,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:28:12,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:28:12,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:28:12,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:28:12,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:28:12,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:28:12,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:28:12,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:28:12,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:28:12,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:28:12,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:28:12,750 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 23:28:12,796 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:28:12,805 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:28:12,806 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:28:12,806 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:28:12,807 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:28:12,807 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:28:12,808 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:28:12,808 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:28:12,808 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:28:12,809 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:28:12,810 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:28:12,810 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:28:12,810 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:28:12,811 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:28:12,811 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:28:12,811 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:28:12,812 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:28:12,812 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:28:12,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:28:12,813 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:28:12,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:28:12,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:28:12,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:28:12,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:28:12,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:28:12,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:28:12,816 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:28:12,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:28:12,817 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:28:12,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:28:12,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:28:12,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:28:12,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:28:12,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:28:12,819 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:28:12,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:28:12,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:28:12,819 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:28:12,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:28:12,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:28:12,820 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:28:12,821 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/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_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2022-11-25 23:28:13,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:28:13,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:28:13,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:28:13,153 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:28:13,154 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:28:13,155 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-25 23:28:16,280 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:28:16,551 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:28:16,556 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-25 23:28:16,571 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/data/f313562fd/fe0d8e4805af46ceae355485dc20c580/FLAGac5ad80bc [2022-11-25 23:28:16,585 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/data/f313562fd/fe0d8e4805af46ceae355485dc20c580 [2022-11-25 23:28:16,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:28:16,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:28:16,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:28:16,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:28:16,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:28:16,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:28:16" (1/1) ... [2022-11-25 23:28:16,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c8a50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:28:16, skipping insertion in model container [2022-11-25 23:28:16,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:28:16" (1/1) ... [2022-11-25 23:28:16,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:28:16,642 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:28:17,030 WARN L237 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_dc95e074-ac09-4389-9094-f2608ef7706b/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-25 23:28:17,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:28:17,053 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:28:17,107 WARN L237 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_dc95e074-ac09-4389-9094-f2608ef7706b/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-25 23:28:17,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:28:17,136 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:28:17,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:28:17 WrapperNode [2022-11-25 23:28:17,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:28:17,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:28:17,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:28:17,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:28:17,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:28:17" (1/1) ... [2022-11-25 23:28:17,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:28:17" (1/1) ... [2022-11-25 23:28:17,197 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2022-11-25 23:28:17,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:28:17,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:28:17,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:28:17,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:28:17,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:28:17" (1/1) ... [2022-11-25 23:28:17,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:28:17" (1/1) ... [2022-11-25 23:28:17,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:28:17" (1/1) ... [2022-11-25 23:28:17,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:28:17" (1/1) ... [2022-11-25 23:28:17,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:28:17" (1/1) ... [2022-11-25 23:28:17,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:28:17" (1/1) ... [2022-11-25 23:28:17,227 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:28:17" (1/1) ... [2022-11-25 23:28:17,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:28:17" (1/1) ... [2022-11-25 23:28:17,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:28:17,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:28:17,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:28:17,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:28:17,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:28:17" (1/1) ... [2022-11-25 23:28:17,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:28:17,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:28:17,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:28:17,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:28:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:28:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:28:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:28:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:28:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:28:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:28:17,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:28:17,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:28:17,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:28:17,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:28:17,445 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:28:17,447 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:28:17,663 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:28:17,793 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:28:17,793 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-25 23:28:17,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:28:17 BoogieIcfgContainer [2022-11-25 23:28:17,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:28:17,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:28:17,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:28:17,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:28:17,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:28:16" (1/3) ... [2022-11-25 23:28:17,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af01836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:28:17, skipping insertion in model container [2022-11-25 23:28:17,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:28:17" (2/3) ... [2022-11-25 23:28:17,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af01836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:28:17, skipping insertion in model container [2022-11-25 23:28:17,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:28:17" (3/3) ... [2022-11-25 23:28:17,845 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2022-11-25 23:28:17,867 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:28:17,867 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 23:28:17,924 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:28:17,931 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2918d9b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:28:17,932 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 23:28:17,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 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) [2022-11-25 23:28:17,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:28:17,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:17,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:17,944 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:17,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:17,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1963659983, now seen corresponding path program 1 times [2022-11-25 23:28:17,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:17,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303903737] [2022-11-25 23:28:17,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:17,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:18,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:18,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303903737] [2022-11-25 23:28:18,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303903737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:18,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:18,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:28:18,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949692649] [2022-11-25 23:28:18,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:18,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:28:18,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:18,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:28:18,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:28:18,241 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 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) 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) [2022-11-25 23:28:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:18,299 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2022-11-25 23:28:18,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:28:18,302 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 [2022-11-25 23:28:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:18,310 INFO L225 Difference]: With dead ends: 27 [2022-11-25 23:28:18,313 INFO L226 Difference]: Without dead ends: 12 [2022-11-25 23:28:18,316 INFO L412 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 [2022-11-25 23:28:18,323 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:18,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:28:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-25 23:28:18,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-11-25 23:28:18,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 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) [2022-11-25 23:28:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2022-11-25 23:28:18,362 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2022-11-25 23:28:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:18,363 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-11-25 23:28:18,364 INFO L496 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) [2022-11-25 23:28:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-11-25 23:28:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:28:18,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:18,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:18,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:28:18,366 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:18,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:18,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1491156930, now seen corresponding path program 1 times [2022-11-25 23:28:18,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:18,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277787856] [2022-11-25 23:28:18,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:18,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:18,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:18,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277787856] [2022-11-25 23:28:18,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277787856] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:28:18,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398748817] [2022-11-25 23:28:18,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:18,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:18,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:28:18,657 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:28:18,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:28:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:18,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:28:18,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:18,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:18,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398748817] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:18,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1711283359] [2022-11-25 23:28:18,946 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-25 23:28:18,947 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:28:18,952 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:28:18,962 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:28:18,964 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:28:19,154 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:28:19,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-25 23:28:19,241 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:28:19,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:28:19,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:19,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:19,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:19,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:19,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:19,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:19,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:28:19,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:19,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:19,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:19,675 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-25 23:28:19,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-25 23:28:19,732 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-25 23:28:19,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-25 23:28:20,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:20,286 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:20,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 238 [2022-11-25 23:28:20,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:20,337 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 23:28:20,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 204 [2022-11-25 23:28:20,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:20,469 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:20,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 232 [2022-11-25 23:28:20,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:20,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:20,550 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 23:28:20,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 209 [2022-11-25 23:28:20,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:20,639 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:20,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:20,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:20,719 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:20,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:21,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:21,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:21,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:21,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:21,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:21,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:21,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:21,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:21,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-25 23:28:21,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:21,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:21,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:21,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:21,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:21,246 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:28:21,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1711283359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:21,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:28:21,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 3, 3] total 7 [2022-11-25 23:28:21,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417849705] [2022-11-25 23:28:21,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:21,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:28:21,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:21,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:28:21,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:28:21,562 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) [2022-11-25 23:28:21,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:21,624 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-11-25 23:28:21,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:28:21,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-11-25 23:28:21,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:21,625 INFO L225 Difference]: With dead ends: 18 [2022-11-25 23:28:21,625 INFO L226 Difference]: Without dead ends: 13 [2022-11-25 23:28:21,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:28:21,627 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:21,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 12 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:28:21,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-11-25 23:28:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-11-25 23:28:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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) [2022-11-25 23:28:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-11-25 23:28:21,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2022-11-25 23:28:21,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:21,636 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-25 23:28:21,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) [2022-11-25 23:28:21,636 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-11-25 23:28:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:28:21,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:21,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:21,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:28:21,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-25 23:28:21,850 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:21,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:21,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1766738179, now seen corresponding path program 1 times [2022-11-25 23:28:21,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:21,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409303645] [2022-11-25 23:28:21,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:21,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:28:21,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:21,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409303645] [2022-11-25 23:28:21,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409303645] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:28:21,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302617156] [2022-11-25 23:28:21,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:21,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:21,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:28:21,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:28:21,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:28:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:22,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:28:22,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:22,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:28:22,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:28:22,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302617156] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:22,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2067578489] [2022-11-25 23:28:22,123 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 23:28:22,123 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:28:22,124 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:28:22,124 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:28:22,124 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:28:22,185 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:28:22,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:28:22,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:28:22,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:22,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:22,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:22,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:28:22,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:22,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:28:22,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:22,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:28:22,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:22,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:28:22,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:22,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:28:22,447 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-25 23:28:22,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-25 23:28:22,495 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-25 23:28:22,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-25 23:28:22,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:22,837 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:22,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 238 [2022-11-25 23:28:22,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:22,892 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 23:28:22,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 204 [2022-11-25 23:28:22,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:22,997 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:22,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 232 [2022-11-25 23:28:23,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:23,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:23,045 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 23:28:23,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 209 [2022-11-25 23:28:23,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:23,098 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:23,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:23,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:23,146 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:23,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:23,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:23,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:23,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:23,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:23,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:23,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:23,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:23,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:23,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:23,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:23,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:23,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-25 23:28:23,622 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:23,627 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:23,629 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:23,658 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:23,661 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:23,664 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:23,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:23,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:23,731 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:28:24,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2067578489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:24,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:28:24,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3, 3, 3] total 8 [2022-11-25 23:28:24,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192041888] [2022-11-25 23:28:24,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:24,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:28:24,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:24,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:28:24,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:28:24,132 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-11-25 23:28:24,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:24,209 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2022-11-25 23:28:24,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:28:24,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2022-11-25 23:28:24,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:24,211 INFO L225 Difference]: With dead ends: 21 [2022-11-25 23:28:24,211 INFO L226 Difference]: Without dead ends: 14 [2022-11-25 23:28:24,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:28:24,212 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:24,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 13 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:28:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-25 23:28:24,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-11-25 23:28:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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) [2022-11-25 23:28:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-11-25 23:28:24,219 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 11 [2022-11-25 23:28:24,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:24,220 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-11-25 23:28:24,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-11-25 23:28:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-11-25 23:28:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 23:28:24,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:24,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:24,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:28:24,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:24,422 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:24,423 INFO L85 PathProgramCache]: Analyzing trace with hash 446479962, now seen corresponding path program 1 times [2022-11-25 23:28:24,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:24,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960946445] [2022-11-25 23:28:24,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:24,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:28:24,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:24,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960946445] [2022-11-25 23:28:24,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960946445] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:28:24,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791865897] [2022-11-25 23:28:24,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:24,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:24,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:28:24,504 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:28:24,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:28:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:24,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:28:24,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:28:24,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:24,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:28:24,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791865897] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:24,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1994454231] [2022-11-25 23:28:24,649 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 23:28:24,649 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:28:24,649 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:28:24,650 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:28:24,650 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:28:24,698 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:28:24,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:28:24,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:28:24,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:24,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:24,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:24,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:24,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:24,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:24,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:28:24,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:24,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:28:24,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:24,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:28:24,923 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-25 23:28:24,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-25 23:28:24,978 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-25 23:28:24,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-25 23:28:25,309 INFO L321 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-11-25 23:28:25,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 308 treesize of output 292 [2022-11-25 23:28:25,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:25,450 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:25,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 314 [2022-11-25 23:28:25,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:25,563 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:25,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 299 treesize of output 308 [2022-11-25 23:28:25,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:25,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:25,685 INFO L321 Elim1Store]: treesize reduction 74, result has 24.5 percent of original size [2022-11-25 23:28:25,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 325 treesize of output 307 [2022-11-25 23:28:25,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:25,753 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:25,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:25,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:25,814 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:25,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:26,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:26,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:26,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:26,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:26,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-25 23:28:26,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:26,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:26,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:26,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:26,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:26,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:26,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:26,914 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:26,916 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:26,919 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:26,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:27,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:27,017 INFO L350 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 [2022-11-25 23:28:27,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:27,144 INFO L350 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 [2022-11-25 23:28:27,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:27,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:27,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:27,250 INFO L350 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 [2022-11-25 23:28:27,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:27,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:27,318 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:28:27,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1994454231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:27,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:28:27,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 10 [2022-11-25 23:28:27,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974010203] [2022-11-25 23:28:27,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:27,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:28:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:27,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:28:27,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:28:27,910 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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) [2022-11-25 23:28:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:28,324 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-11-25 23:28:28,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:28:28,325 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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 12 [2022-11-25 23:28:28,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:28,325 INFO L225 Difference]: With dead ends: 25 [2022-11-25 23:28:28,325 INFO L226 Difference]: Without dead ends: 20 [2022-11-25 23:28:28,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:28:28,326 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:28,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 8 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:28:28,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-25 23:28:28,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2022-11-25 23:28:28,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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) [2022-11-25 23:28:28,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-11-25 23:28:28,356 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 12 [2022-11-25 23:28:28,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:28,356 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-11-25 23:28:28,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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) [2022-11-25 23:28:28,357 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-11-25 23:28:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:28:28,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:28,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:28,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:28:28,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:28,564 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:28,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:28,565 INFO L85 PathProgramCache]: Analyzing trace with hash 954324368, now seen corresponding path program 1 times [2022-11-25 23:28:28,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:28,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073651664] [2022-11-25 23:28:28,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:28,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:28:28,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:28,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073651664] [2022-11-25 23:28:28,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073651664] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:28:28,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691555205] [2022-11-25 23:28:28,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:28,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:28,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:28:28,684 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:28:28,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:28:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:28,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:28:28,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:28:28,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:28:28,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691555205] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:28,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [587149528] [2022-11-25 23:28:28,829 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 23:28:28,829 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:28:28,829 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:28:28,830 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:28:28,830 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:28:28,879 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:28:28,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-25 23:28:28,921 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:28:28,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:28:28,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:28,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:28:28,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:28,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:28:28,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:28,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:28,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:28,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:28:29,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:29,009 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:29,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:29,124 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-25 23:28:29,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-25 23:28:29,160 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-25 23:28:29,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-25 23:28:29,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:29,467 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 23:28:29,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 282 [2022-11-25 23:28:29,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:29,578 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:29,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 309 treesize of output 318 [2022-11-25 23:28:29,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:29,678 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:29,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 312 [2022-11-25 23:28:29,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:29,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:29,736 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 23:28:29,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 312 treesize of output 281 [2022-11-25 23:28:29,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:29,796 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:29,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:29,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:29,841 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:29,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:30,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:30,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:30,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:30,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:30,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:30,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:30,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:30,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-25 23:28:30,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:30,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:30,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:30,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:30,420 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:30,423 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:30,425 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:30,489 INFO L350 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 [2022-11-25 23:28:30,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:30,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:30,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:30,600 INFO L350 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 [2022-11-25 23:28:30,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:30,668 INFO L350 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 [2022-11-25 23:28:30,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:30,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:30,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:30,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:30,812 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:28:31,494 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '551#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-25 23:28:31,495 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:28:31,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:28:31,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-11-25 23:28:31,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421862376] [2022-11-25 23:28:31,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:28:31,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:28:31,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:31,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:28:31,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:28:31,496 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-11-25 23:28:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:31,537 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-11-25 23:28:31,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:31,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 [2022-11-25 23:28:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:31,539 INFO L225 Difference]: With dead ends: 28 [2022-11-25 23:28:31,539 INFO L226 Difference]: Without dead ends: 17 [2022-11-25 23:28:31,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:28:31,540 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:31,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 12 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:28:31,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-25 23:28:31,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-25 23:28:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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) [2022-11-25 23:28:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-25 23:28:31,549 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2022-11-25 23:28:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:31,550 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-25 23:28:31,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-11-25 23:28:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-25 23:28:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 23:28:31,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:31,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:31,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-25 23:28:31,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:31,757 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:31,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:31,758 INFO L85 PathProgramCache]: Analyzing trace with hash -694979649, now seen corresponding path program 2 times [2022-11-25 23:28:31,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:31,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983101603] [2022-11-25 23:28:31,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:31,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:28:31,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:31,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983101603] [2022-11-25 23:28:31,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983101603] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:28:31,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135134057] [2022-11-25 23:28:31,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:28:31,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:31,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:28:31,866 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:28:31,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:28:31,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:28:31,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:28:31,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:28:31,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:28:32,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:28:32,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135134057] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:32,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [393947390] [2022-11-25 23:28:32,036 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 23:28:32,037 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:28:32,037 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:28:32,037 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:28:32,037 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:28:32,080 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:28:32,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-25 23:28:32,128 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:28:32,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:28:32,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:32,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:28:32,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:32,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:28:32,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:32,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:32,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:32,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:28:32,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:32,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:32,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:32,318 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-25 23:28:32,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-25 23:28:32,373 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-25 23:28:32,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-25 23:28:32,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:32,548 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 23:28:32,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 228 treesize of output 210 [2022-11-25 23:28:32,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:32,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:32,600 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 23:28:32,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 244 treesize of output 221 [2022-11-25 23:28:32,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:32,685 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:32,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 234 [2022-11-25 23:28:32,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:32,760 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:32,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 228 [2022-11-25 23:28:32,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:32,811 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:32,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:32,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:32,865 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:32,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:33,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:33,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:33,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:33,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:33,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:33,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:33,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:33,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:33,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:33,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:33,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:33,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-25 23:28:33,167 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:33,169 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:33,171 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:33,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:33,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:33,249 INFO L350 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 [2022-11-25 23:28:33,328 INFO L350 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 [2022-11-25 23:28:33,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:33,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:33,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:33,433 INFO L350 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 [2022-11-25 23:28:33,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:33,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:33,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:33,546 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:28:34,200 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '732#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-25 23:28:34,200 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:28:34,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:28:34,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-25 23:28:34,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555409671] [2022-11-25 23:28:34,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:28:34,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:28:34,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:34,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:28:34,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:28:34,202 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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) [2022-11-25 23:28:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:34,281 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-11-25 23:28:34,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:28:34,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 15 [2022-11-25 23:28:34,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:34,283 INFO L225 Difference]: With dead ends: 31 [2022-11-25 23:28:34,283 INFO L226 Difference]: Without dead ends: 24 [2022-11-25 23:28:34,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:28:34,284 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 61 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:34,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 14 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:28:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-25 23:28:34,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2022-11-25 23:28:34,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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) [2022-11-25 23:28:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-11-25 23:28:34,293 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 15 [2022-11-25 23:28:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:34,293 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-25 23:28:34,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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) [2022-11-25 23:28:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-11-25 23:28:34,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:28:34,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:34,294 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:34,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-25 23:28:34,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:34,498 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:34,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:34,499 INFO L85 PathProgramCache]: Analyzing trace with hash 706001952, now seen corresponding path program 3 times [2022-11-25 23:28:34,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:34,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279075266] [2022-11-25 23:28:34,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:34,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:35,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:35,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279075266] [2022-11-25 23:28:35,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279075266] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:28:35,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880915151] [2022-11-25 23:28:35,930 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:28:35,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:35,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:28:35,931 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:28:35,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:28:36,225 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:28:36,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:28:36,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-25 23:28:36,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:36,235 INFO L350 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 [2022-11-25 23:28:36,282 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:28:36,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 23:28:36,319 INFO L350 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 13 treesize of output 9 [2022-11-25 23:28:36,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:28:36,490 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:28:36,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 63 [2022-11-25 23:28:36,496 INFO L350 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 33 treesize of output 23 [2022-11-25 23:28:36,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:36,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-25 23:28:36,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:36,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:36,612 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-11-25 23:28:36,619 INFO L350 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 30 treesize of output 32 [2022-11-25 23:28:36,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:36,626 INFO L350 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 35 treesize of output 34 [2022-11-25 23:28:36,800 INFO L350 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 59 treesize of output 43 [2022-11-25 23:28:36,807 INFO L350 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 43 treesize of output 31 [2022-11-25 23:28:36,867 INFO L350 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 35 treesize of output 23 [2022-11-25 23:28:36,919 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:28:36,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:37,129 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse0 (* |c_ULTIMATE.start_main_~len~0#1| 2))) (and (forall ((v_ArrVal_406 (Array Int Int)) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (<= .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_406) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_405)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_402)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) 1))) (forall ((v_ArrVal_406 (Array Int Int)) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_406) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_405)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_402)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) 1) .cse0)))) is different from false [2022-11-25 23:28:37,166 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse0 (* |c_ULTIMATE.start_main_~len~0#1| 2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_406 (Array Int Int)) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (<= .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_406) (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse2)) (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_402) .cse2)) 1))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_406 (Array Int Int)) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_406) (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse2)) (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_402) .cse2)) 1) .cse0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|))))) is different from false [2022-11-25 23:28:37,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:28:37,193 INFO L350 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 46 treesize of output 47 [2022-11-25 23:28:37,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:28:37,208 INFO L350 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 98 treesize of output 101 [2022-11-25 23:28:37,217 INFO L350 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 37 treesize of output 23 [2022-11-25 23:28:37,295 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:28:37,296 INFO L350 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 46 treesize of output 47 [2022-11-25 23:28:37,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:28:37,326 INFO L350 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 98 treesize of output 101 [2022-11-25 23:28:37,335 INFO L350 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 37 treesize of output 23 [2022-11-25 23:28:37,437 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_405 Int) (v_ArrVal_401 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_401) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse2))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_405 Int) (v_ArrVal_401 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_401) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse2)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_402 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_402) .cse2) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) is different from false [2022-11-25 23:28:37,513 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_405 Int) (v_ArrVal_401 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_401) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse3) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_405 Int) (v_ArrVal_401 (Array Int Int))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_401) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse3))))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_402 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse4) (select (store (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_399) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_402) .cse3))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|)))))) is different from false [2022-11-25 23:28:37,566 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_402 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_399) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_402) .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_405 Int) (v_ArrVal_401 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_401) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse2) .cse1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_405 Int) (v_ArrVal_401 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_401) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse2) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0)))) is different from false [2022-11-25 23:28:37,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:28:37,863 INFO L350 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 26 treesize of output 27 [2022-11-25 23:28:37,867 INFO L350 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 45 treesize of output 41 [2022-11-25 23:28:37,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:37,886 INFO L350 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 29 treesize of output 25 [2022-11-25 23:28:37,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:37,891 INFO L350 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 31 treesize of output 23 [2022-11-25 23:28:37,992 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-25 23:28:37,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880915151] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:37,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [803450787] [2022-11-25 23:28:37,994 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 23:28:37,994 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:28:37,995 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:28:37,995 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:28:37,995 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:28:38,037 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:28:38,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-25 23:28:38,077 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:28:38,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:28:38,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:38,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:38,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:38,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:28:38,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:38,135 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:38,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:38,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:38,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:28:38,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:38,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:28:38,276 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-25 23:28:38,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-25 23:28:38,314 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-25 23:28:38,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-25 23:28:38,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:38,558 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 23:28:38,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 228 treesize of output 210 [2022-11-25 23:28:38,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:38,664 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:38,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 238 [2022-11-25 23:28:38,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:38,777 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:38,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 232 [2022-11-25 23:28:38,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:38,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:38,828 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 23:28:38,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 209 [2022-11-25 23:28:38,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:38,900 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:38,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:38,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:38,949 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:38,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:39,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:39,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:39,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:39,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:39,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:39,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:39,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:39,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:39,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-25 23:28:39,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:39,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:39,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:39,347 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:39,351 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:39,353 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:39,423 INFO L350 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 [2022-11-25 23:28:39,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:39,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:39,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:39,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:39,576 INFO L350 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 [2022-11-25 23:28:39,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:39,657 INFO L350 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 [2022-11-25 23:28:39,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:39,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:39,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:39,846 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:28:41,305 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '972#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-25 23:28:41,305 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:28:41,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:28:41,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 42 [2022-11-25 23:28:41,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877731776] [2022-11-25 23:28:41,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:28:41,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-25 23:28:41,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:41,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-25 23:28:41,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1810, Unknown=15, NotChecked=450, Total=2450 [2022-11-25 23:28:41,308 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 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) [2022-11-25 23:28:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:47,714 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-11-25 23:28:47,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 23:28:47,715 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 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 17 [2022-11-25 23:28:47,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:47,716 INFO L225 Difference]: With dead ends: 51 [2022-11-25 23:28:47,716 INFO L226 Difference]: Without dead ends: 49 [2022-11-25 23:28:47,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=394, Invalid=3033, Unknown=15, NotChecked=590, Total=4032 [2022-11-25 23:28:47,719 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 106 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 4 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:47,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 81 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 426 Invalid, 6 Unknown, 192 Unchecked, 0.6s Time] [2022-11-25 23:28:47,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-25 23:28:47,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2022-11-25 23:28:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 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) [2022-11-25 23:28:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-11-25 23:28:47,740 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2022-11-25 23:28:47,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:47,740 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-11-25 23:28:47,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 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) [2022-11-25 23:28:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-11-25 23:28:47,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:28:47,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:47,741 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:47,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:28:47,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-25 23:28:47,949 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:47,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:47,950 INFO L85 PathProgramCache]: Analyzing trace with hash 409571466, now seen corresponding path program 4 times [2022-11-25 23:28:47,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:47,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983880155] [2022-11-25 23:28:47,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:47,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:28:48,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:48,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983880155] [2022-11-25 23:28:48,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983880155] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:48,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:48,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:28:48,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061140439] [2022-11-25 23:28:48,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:48,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:28:48,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:48,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:28:48,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:28:48,120 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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) [2022-11-25 23:28:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:48,210 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-11-25 23:28:48,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:28:48,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 18 [2022-11-25 23:28:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:48,213 INFO L225 Difference]: With dead ends: 33 [2022-11-25 23:28:48,213 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 23:28:48,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:28:48,215 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:48,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 7 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:28:48,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 23:28:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-25 23:28:48,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 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) [2022-11-25 23:28:48,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-11-25 23:28:48,255 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2022-11-25 23:28:48,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:48,255 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-11-25 23:28:48,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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) [2022-11-25 23:28:48,256 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-11-25 23:28:48,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:28:48,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:48,257 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:48,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:28:48,257 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:48,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:48,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1554881251, now seen corresponding path program 5 times [2022-11-25 23:28:48,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:48,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005687381] [2022-11-25 23:28:48,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:48,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:48,373 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:28:48,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:48,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005687381] [2022-11-25 23:28:48,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005687381] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:28:48,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607437625] [2022-11-25 23:28:48,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:28:48,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:48,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:28:48,376 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:28:48,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:28:48,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 23:28:48,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:28:48,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:28:48,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:28:48,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:28:48,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607437625] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 23:28:48,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:28:48,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2022-11-25 23:28:48,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391591191] [2022-11-25 23:28:48,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:48,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:28:48,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:48,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:28:48,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:28:48,715 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-11-25 23:28:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:48,831 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-11-25 23:28:48,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:28:48,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 18 [2022-11-25 23:28:48,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:48,836 INFO L225 Difference]: With dead ends: 42 [2022-11-25 23:28:48,836 INFO L226 Difference]: Without dead ends: 34 [2022-11-25 23:28:48,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:28:48,840 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:48,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 14 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:28:48,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-25 23:28:48,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-11-25 23:28:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 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) [2022-11-25 23:28:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-11-25 23:28:48,871 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2022-11-25 23:28:48,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:48,872 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-11-25 23:28:48,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-11-25 23:28:48,872 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-11-25 23:28:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:28:48,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:48,873 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:48,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:28:49,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:49,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:49,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash 823590399, now seen corresponding path program 6 times [2022-11-25 23:28:49,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:49,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567151196] [2022-11-25 23:28:49,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:28:49,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:49,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567151196] [2022-11-25 23:28:49,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567151196] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:28:49,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552759574] [2022-11-25 23:28:49,265 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:28:49,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:49,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:28:49,267 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:28:49,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:28:49,416 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:28:49,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:28:49,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:28:49,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:28:49,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:49,551 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:28:49,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552759574] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:49,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2081005867] [2022-11-25 23:28:49,553 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 23:28:49,553 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:28:49,553 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:28:49,554 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:28:49,554 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:28:49,604 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:28:49,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-25 23:28:49,653 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:28:49,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:28:49,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:49,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:49,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:49,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:28:49,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:49,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:49,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:49,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:49,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:28:49,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:49,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:28:49,844 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-25 23:28:49,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-11-25 23:28:49,932 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-25 23:28:49,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-11-25 23:28:50,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:50,294 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:50,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 238 [2022-11-25 23:28:50,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:50,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:50,340 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 23:28:50,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 204 [2022-11-25 23:28:50,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:50,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:50,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:50,446 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:28:50,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 238 treesize of output 215 [2022-11-25 23:28:50,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:50,527 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:50,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 228 [2022-11-25 23:28:50,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:50,579 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:50,580 INFO L350 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 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:50,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:50,622 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:50,623 INFO L350 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 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:50,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:50,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:50,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:50,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:50,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-25 23:28:50,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:50,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:50,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:50,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:50,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:50,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:50,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:50,947 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:50,949 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:50,951 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:51,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:51,038 INFO L350 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 [2022-11-25 23:28:51,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:51,126 INFO L350 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 [2022-11-25 23:28:51,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:51,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:51,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:51,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:51,224 INFO L350 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 [2022-11-25 23:28:51,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:51,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:51,344 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:28:52,216 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1630#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-25 23:28:52,216 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:28:52,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:28:52,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2022-11-25 23:28:52,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174982948] [2022-11-25 23:28:52,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:28:52,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:28:52,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:52,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:28:52,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:28:52,220 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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) [2022-11-25 23:28:52,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:52,491 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-11-25 23:28:52,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:28:52,492 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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 18 [2022-11-25 23:28:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:52,492 INFO L225 Difference]: With dead ends: 53 [2022-11-25 23:28:52,493 INFO L226 Difference]: Without dead ends: 41 [2022-11-25 23:28:52,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:28:52,494 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 62 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:52,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 30 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:28:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-25 23:28:52,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2022-11-25 23:28:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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) [2022-11-25 23:28:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-11-25 23:28:52,525 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2022-11-25 23:28:52,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:52,525 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-11-25 23:28:52,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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) [2022-11-25 23:28:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-11-25 23:28:52,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:28:52,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:52,527 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:52,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:28:52,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 23:28:52,733 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:52,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash 74992768, now seen corresponding path program 1 times [2022-11-25 23:28:52,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:52,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453925118] [2022-11-25 23:28:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:52,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:28:53,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:53,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453925118] [2022-11-25 23:28:53,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453925118] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:28:53,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579737732] [2022-11-25 23:28:53,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:53,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:53,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:28:53,239 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:28:53,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 23:28:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:53,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-25 23:28:53,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:53,549 INFO L350 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 [2022-11-25 23:28:53,717 INFO L350 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 22 treesize of output 10 [2022-11-25 23:28:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:28:53,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:53,886 INFO L350 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 36 treesize of output 32 [2022-11-25 23:28:53,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:53,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:54,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:28:54,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579737732] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:54,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [227512773] [2022-11-25 23:28:54,017 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 23:28:54,017 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:28:54,017 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:28:54,018 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:28:54,018 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:28:54,072 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:28:54,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-25 23:28:54,125 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:28:54,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:28:54,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:54,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:54,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:54,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:28:54,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:54,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:28:54,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:54,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:28:54,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:54,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:28:54,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:54,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:28:54,358 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-25 23:28:54,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-11-25 23:28:54,446 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-25 23:28:54,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-11-25 23:28:54,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:54,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:54,761 INFO L321 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-11-25 23:28:54,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 308 treesize of output 292 [2022-11-25 23:28:54,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:54,901 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:54,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 314 [2022-11-25 23:28:54,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:55,021 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:55,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 299 treesize of output 308 [2022-11-25 23:28:55,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:55,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:55,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:55,134 INFO L321 Elim1Store]: treesize reduction 89, result has 26.4 percent of original size [2022-11-25 23:28:55,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 325 treesize of output 307 [2022-11-25 23:28:55,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:55,212 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:55,213 INFO L350 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 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:55,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:55,273 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:55,273 INFO L350 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 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:55,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:55,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:55,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:55,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:55,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-25 23:28:55,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:55,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:55,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:55,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:55,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:55,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:55,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:55,676 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:55,681 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:55,684 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:55,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:55,753 INFO L350 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 [2022-11-25 23:28:55,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:55,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:55,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:55,859 INFO L350 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 [2022-11-25 23:28:55,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:55,943 INFO L350 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 [2022-11-25 23:28:55,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:28:56,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:56,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:56,255 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:28:57,103 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1948#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-25 23:28:57,103 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:28:57,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:28:57,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 24 [2022-11-25 23:28:57,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621730841] [2022-11-25 23:28:57,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:28:57,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 23:28:57,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:57,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 23:28:57,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2022-11-25 23:28:57,106 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 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) [2022-11-25 23:28:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:57,827 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-11-25 23:28:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:28:57,827 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 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 20 [2022-11-25 23:28:57,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:57,828 INFO L225 Difference]: With dead ends: 44 [2022-11-25 23:28:57,828 INFO L226 Difference]: Without dead ends: 42 [2022-11-25 23:28:57,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=269, Invalid=1453, Unknown=0, NotChecked=0, Total=1722 [2022-11-25 23:28:57,830 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 120 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:57,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 77 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:28:57,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-25 23:28:57,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-11-25 23:28:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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) [2022-11-25 23:28:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-11-25 23:28:57,853 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 20 [2022-11-25 23:28:57,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:57,853 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-11-25 23:28:57,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 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) [2022-11-25 23:28:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-11-25 23:28:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:28:57,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:57,854 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:57,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 23:28:58,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:58,060 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:58,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:58,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1025716738, now seen corresponding path program 7 times [2022-11-25 23:28:58,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:58,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261537901] [2022-11-25 23:28:58,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:58,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:28:58,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:58,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261537901] [2022-11-25 23:28:58,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261537901] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:28:58,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785850346] [2022-11-25 23:28:58,159 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:28:58,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:28:58,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:28:58,173 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:28:58,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 23:28:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:58,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:28:58,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:28:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:28:58,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:28:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:28:58,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785850346] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:28:58,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1973573275] [2022-11-25 23:28:58,469 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 23:28:58,469 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:28:58,469 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:28:58,469 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:28:58,470 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:28:58,533 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:28:58,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:28:58,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:28:58,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:58,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:58,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:58,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:58,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:28:58,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:58,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:28:58,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:58,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:58,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:58,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:28:58,726 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-25 23:28:58,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-11-25 23:28:58,801 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-25 23:28:58,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-11-25 23:28:58,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:58,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:59,056 INFO L321 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-11-25 23:28:59,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 220 [2022-11-25 23:28:59,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:59,192 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:59,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 234 [2022-11-25 23:28:59,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:59,298 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:28:59,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 228 [2022-11-25 23:28:59,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:59,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:59,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:59,407 INFO L321 Elim1Store]: treesize reduction 89, result has 26.4 percent of original size [2022-11-25 23:28:59,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 245 treesize of output 235 [2022-11-25 23:28:59,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:59,474 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:59,475 INFO L350 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 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:59,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:59,522 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:28:59,522 INFO L350 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 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:28:59,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:28:59,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:28:59,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:59,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:59,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:59,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:59,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:59,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:59,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-25 23:28:59,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:28:59,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:28:59,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:28:59,921 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:59,923 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:28:59,927 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:29:00,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:29:00,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:29:00,038 INFO L350 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 [2022-11-25 23:29:00,128 INFO L350 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 [2022-11-25 23:29:00,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:29:00,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:29:00,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:29:00,235 INFO L350 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 [2022-11-25 23:29:00,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:29:00,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:29:00,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:29:00,373 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:29:01,511 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2238#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-25 23:29:01,512 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:29:01,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:29:01,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-11-25 23:29:01,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129917902] [2022-11-25 23:29:01,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:29:01,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:29:01,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:29:01,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:29:01,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:29:01,514 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 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) [2022-11-25 23:29:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:29:01,641 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-11-25 23:29:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:29:01,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 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 20 [2022-11-25 23:29:01,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:29:01,642 INFO L225 Difference]: With dead ends: 45 [2022-11-25 23:29:01,642 INFO L226 Difference]: Without dead ends: 22 [2022-11-25 23:29:01,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:29:01,643 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:29:01,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 18 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:29:01,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-25 23:29:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-25 23:29:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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) [2022-11-25 23:29:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-11-25 23:29:01,657 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-11-25 23:29:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:29:01,657 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-11-25 23:29:01,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 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) [2022-11-25 23:29:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-11-25 23:29:01,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:29:01,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:29:01,658 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:29:01,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 23:29:01,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 23:29:01,862 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:29:01,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:29:01,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1971844054, now seen corresponding path program 2 times [2022-11-25 23:29:01,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:29:01,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660369715] [2022-11-25 23:29:01,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:29:01,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:29:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:29:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 23:29:01,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:29:01,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660369715] [2022-11-25 23:29:01,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660369715] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:29:01,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422883675] [2022-11-25 23:29:01,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:29:01,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:29:01,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:29:01,989 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:29:02,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 23:29:02,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:29:02,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:29:02,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:29:02,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:29:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 23:29:02,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:29:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 23:29:02,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422883675] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:29:02,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1961564480] [2022-11-25 23:29:02,279 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 23:29:02,279 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:29:02,280 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:29:02,280 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:29:02,280 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:29:02,336 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:29:02,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:29:02,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:29:02,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:29:02,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:29:02,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:29:02,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:29:02,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:29:02,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:29:02,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:29:02,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:29:02,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:29:02,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:29:02,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:29:02,592 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-25 23:29:02,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-25 23:29:02,635 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-25 23:29:02,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-25 23:29:02,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:29:03,068 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:29:03,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 309 treesize of output 318 [2022-11-25 23:29:03,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:29:03,125 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 23:29:03,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 302 treesize of output 276 [2022-11-25 23:29:03,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:29:03,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:29:03,197 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 23:29:03,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 318 treesize of output 287 [2022-11-25 23:29:03,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:29:03,300 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-25 23:29:03,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 299 treesize of output 308 [2022-11-25 23:29:03,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:29:03,349 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:29:03,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:29:03,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:29:03,414 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-25 23:29:03,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 23:29:03,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:29:03,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:29:03,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:29:03,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:29:03,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:29:03,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:29:03,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:29:03,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:29:03,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-25 23:29:03,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:29:03,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:29:03,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:29:03,879 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:29:03,881 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:29:03,883 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:29:03,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:29:03,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:29:03,963 INFO L350 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 [2022-11-25 23:29:04,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:29:04,067 INFO L350 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 [2022-11-25 23:29:04,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:29:04,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:29:04,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:29:04,149 INFO L350 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 [2022-11-25 23:29:04,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:29:04,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:29:04,635 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:29:06,572 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2505#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (or (and (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= 3 |ULTIMATE.start_main_~expected~0#1|)) (and (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_get_data_at_~head#1.base_51| Int) (|v_ULTIMATE.start_sll_get_data_at_~head#1.offset_51| Int)) (and (<= 3 (select (select |#memory_int| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_51|) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_51|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_51|) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_51|) 3))) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|))) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-25 23:29:06,572 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:29:06,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:29:06,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-11-25 23:29:06,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617537277] [2022-11-25 23:29:06,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:29:06,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:29:06,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:29:06,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:29:06,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:29:06,576 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 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) [2022-11-25 23:29:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:29:06,671 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-11-25 23:29:06,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:29:06,671 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 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) Word has length 21 [2022-11-25 23:29:06,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:29:06,672 INFO L225 Difference]: With dead ends: 22 [2022-11-25 23:29:06,672 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:29:06,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:29:06,673 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:29:06,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 10 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:29:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:29:06,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:29:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:29:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:29:06,675 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-11-25 23:29:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:29:06,675 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:29:06,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 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) [2022-11-25 23:29:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:29:06,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:29:06,678 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 23:29:06,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 23:29:06,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 23:29:06,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 23:29:12,255 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-25 23:29:12,255 INFO L895 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse28 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_update_at_~data#1|)) (.cse1 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse2 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse3 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse4 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse6 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse7 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse8 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse9 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse10 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse11 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse12 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse13 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse14 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse15 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse16 (<= .cse28 |ULTIMATE.start_main_~len~0#1|)) (.cse17 (= |#NULL.offset| 0)) (.cse18 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse19 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse20 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse21 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse22 (<= 0 |#StackHeapBarrier|)) (.cse23 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse24 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse25 (<= |ULTIMATE.start_main_~len~0#1| .cse28)) (.cse26 (= |#NULL.base| 0))) (or (and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~i~0#1| 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= |ULTIMATE.start_sll_update_at_~index#1| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse24 .cse25 .cse26) (let ((.cse27 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) 4))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) (+ 2 |ULTIMATE.start_main_~i~0#1|)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (not (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse27)) .cse21 (<= (+ |ULTIMATE.start_sll_update_at_~index#1| 1) |ULTIMATE.start_main_~i~0#1|) .cse22 .cse23 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| .cse27) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base|) 4))) .cse24 (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse25 .cse26))))) [2022-11-25 23:29:12,255 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 23:29:12,255 INFO L902 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2022-11-25 23:29:12,256 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse10 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse18 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|))) (.cse21 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse14 (* |ULTIMATE.start_main_~len~0#1| 2)) (.cse28 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse22 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse4 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse23 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse24 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse6 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse25 (<= |ULTIMATE.start_sll_update_at_~data#1| 3)) (.cse26 (= |ULTIMATE.start_sll_update_at_~data#1| .cse10)) (.cse27 (<= |ULTIMATE.start_sll_update_at_~index#1| 1)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse29 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse8 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse9 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse13 (= |#NULL.offset| 0)) (.cse15 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse30 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse31 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse32 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse33 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse16 (<= 0 |#StackHeapBarrier|)) (.cse17 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse34 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse19 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse20 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_sll_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_update_at_#in~head#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|) .cse7 .cse8 (= |ULTIMATE.start_sll_update_at_~data#1| |ULTIMATE.start_sll_update_at_#in~data#1|) .cse9 (= .cse10 |ULTIMATE.start_main_~new_data~0#1|) .cse11 .cse12 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) .cse13 (= .cse14 (+ |ULTIMATE.start_sll_update_at_~data#1| 1)) (= |ULTIMATE.start_sll_update_at_~index#1| |ULTIMATE.start_main_~i~0#1|) .cse15 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse16 .cse17 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_update_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse22 .cse1 .cse2 .cse3 .cse4 .cse23 (= |ULTIMATE.start_main_~i~0#1| 1) .cse5 .cse24 .cse6 .cse25 .cse26 .cse27 (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_402 Int)) (= (select (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_402) .cse28) |ULTIMATE.start_sll_update_at_~head#1.offset|)))) .cse7 .cse29 .cse8 .cse9 .cse11 .cse13 .cse30 .cse31 .cse32 .cse33 (<= (+ |ULTIMATE.start_sll_update_at_~index#1| 1) |ULTIMATE.start_main_~i~0#1|) .cse16 .cse17 .cse18 .cse34 (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_405 Int) (v_ArrVal_401 (Array Int Int))) (= |ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_401) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse28))))) .cse19 .cse20) (and .cse21 (= .cse14 (+ (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) .cse28)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse28)) 1)) .cse22 .cse2 .cse3 .cse4 .cse23 .cse5 .cse24 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) .cse6 .cse25 (<= |ULTIMATE.start_sll_update_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse26 .cse27 .cse7 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse30 .cse31 (not (= |ULTIMATE.start_sll_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) 4))) .cse32 .cse33 .cse16 .cse17 .cse34 .cse19 .cse20)))) [2022-11-25 23:29:12,256 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2022-11-25 23:29:12,257 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse43 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) 4)) (.cse42 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse9 (+ 2 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0)) (.cse2 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse13 (<= |ULTIMATE.start_sll_update_at_~data#1| 3)) (.cse14 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse15 (<= |ULTIMATE.start_sll_update_at_~index#1| 1)) (.cse27 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse31 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|)) (.cse35 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_update_at_~data#1|)) (.cse3 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse4 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse5 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse6 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse7 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse8 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse10 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse11 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse12 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse16 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse37 (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse9)) (.cse17 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse18 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse19 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse20 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse21 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse22 (<= .cse42 |ULTIMATE.start_main_~len~0#1|)) (.cse23 (= |#NULL.offset| 0)) (.cse24 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse25 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse26 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse38 (not (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse43))) (.cse28 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse39 (<= (+ |ULTIMATE.start_sll_update_at_~index#1| 1) |ULTIMATE.start_main_~i~0#1|)) (.cse29 (<= 0 |#StackHeapBarrier|)) (.cse30 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse40 (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| .cse43) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base|) 4)))) (.cse32 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse33 (<= |ULTIMATE.start_main_~len~0#1| .cse42)) (.cse34 (= |#NULL.base| 0))) (or (and .cse0 (<= 2 .cse1) .cse2 .cse3 .cse4 .cse5 (<= .cse1 2) .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~len~0#1| .cse9) .cse10 .cse11 .cse12 .cse13 (= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_update_at_~index#1| 0) .cse14 (= |ULTIMATE.start_sll_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (let ((.cse36 (+ .cse1 1))) (and .cse0 .cse2 .cse35 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (= (+ (* 2 (div .cse36 (- 2))) |ULTIMATE.start_main_~expected~0#1| 1) 0) .cse12 .cse13 (= (mod .cse36 2) 0) .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse38 .cse27 .cse28 .cse39 .cse29 .cse30 .cse31 .cse40 .cse32 .cse33 .cse34)) (and .cse35 .cse3 .cse4 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16 .cse37 .cse17 .cse18 .cse19 (= (+ (* (div (+ (let ((.cse41 (+ |ULTIMATE.start_sll_get_data_at_~head#1.offset| 4))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse41)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse41))) 1) (- 2)) 2) |ULTIMATE.start_main_~expected~0#1| 1) 0) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse20 .cse21 .cse22 .cse23 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse24 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) .cse25 .cse26 .cse38 .cse28 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| 0) .cse39 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse29 .cse30 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse40 .cse32 (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse33 .cse34)))) [2022-11-25 23:29:12,257 INFO L895 garLoopResultBuilder]: At program point L625(lines 613 632) the Hoare annotation is: false [2022-11-25 23:29:12,257 INFO L895 garLoopResultBuilder]: At program point L576(lines 576 578) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_node_create_~data#1| |ULTIMATE.start_node_create_#in~data#1|)) (.cse1 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|))) (.cse4 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse6 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse7 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse8 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse9 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse10 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|)) (.cse13 (= |#NULL.offset| 0)) (.cse14 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_node_create_#in~data#1|)) (.cse15 (<= 0 |#StackHeapBarrier|)) (.cse16 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse17 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))) (.cse18 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse19 (= |#NULL.base| 0))) (or (and .cse0 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_sll_create_~len#1| 2) .cse19) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2022-11-25 23:29:12,257 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-11-25 23:29:12,258 INFO L895 garLoopResultBuilder]: At program point L618-3(lines 618 621) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse28 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse27 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse5 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse6 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse7 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse8 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse9 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse10 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse11 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse12 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse29 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse13 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse14 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse15 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse16 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse17 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse18 (= |#NULL.offset| 0)) (.cse19 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse20 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse21 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse22 (<= 0 |#StackHeapBarrier|)) (.cse23 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse24 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse25 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse26 (= |#NULL.base| 0))) (or (let ((.cse1 (select .cse28 4))) (let ((.cse4 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse3 (select (select |#memory_int| .cse1) (select .cse27 4)))) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse1)) .cse2 (<= .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_sll_update_at_~data#1| 3) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= .cse4 .cse3) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26))) (and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse5 .cse6 .cse7 .cse9 .cse11 .cse13 .cse15 .cse16 .cse17 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) .cse18 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse22 .cse23 (= |ULTIMATE.start_main_~len~0#1| .cse29) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse25 .cse26) (let ((.cse31 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (and (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_update_at_~data#1|) .cse0 (= (* |ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse30 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select |#memory_int| (select .cse28 .cse30)) (select .cse27 .cse30))) 1)) .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse29 0) .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|) (<= .cse31 |ULTIMATE.start_main_~len~0#1|) .cse18 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse19 .cse20 (not (= |ULTIMATE.start_sll_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) 4))) .cse21 .cse22 .cse23 .cse24 .cse25 (<= |ULTIMATE.start_main_~len~0#1| .cse31) .cse26)))) [2022-11-25 23:29:12,258 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse5 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse14 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse0 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse4 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse6 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse9 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse10 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (<= 0 |#StackHeapBarrier|)) (.cse13 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse15 (<= |ULTIMATE.start_sll_create_~len#1| 2)) (.cse16 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse15 .cse16))) [2022-11-25 23:29:12,258 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2022-11-25 23:29:12,258 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 23:29:12,261 INFO L445 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1] [2022-11-25 23:29:12,264 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:29:12,284 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,291 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,291 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,333 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,333 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,334 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,334 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,334 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,335 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,335 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,335 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,345 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,345 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,345 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,347 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,347 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,349 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,350 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,350 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,350 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,368 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,370 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,376 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-25 23:29:12,377 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,377 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2022-11-25 23:29:12,377 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] [2022-11-25 23:29:12,378 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-25 23:29:12,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,378 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-25 23:29:12,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,379 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_401,QUANTIFIED] [2022-11-25 23:29:12,379 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] [2022-11-25 23:29:12,379 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-25 23:29:12,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,382 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,383 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-25 23:29:12,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,383 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2022-11-25 23:29:12,384 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] [2022-11-25 23:29:12,384 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-25 23:29:12,384 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,385 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-25 23:29:12,385 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,385 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_401,QUANTIFIED] [2022-11-25 23:29:12,385 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] [2022-11-25 23:29:12,385 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-25 23:29:12,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:29:12 BoogieIcfgContainer [2022-11-25 23:29:12,389 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:29:12,389 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:29:12,389 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:29:12,390 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:29:12,390 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:28:17" (3/4) ... [2022-11-25 23:29:12,393 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:29:12,411 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-11-25 23:29:12,412 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-25 23:29:12,412 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 23:29:12,413 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:29:12,440 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((2 == len && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && #NULL == 0)) || ((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head == 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(#memory_$Pointer$[head][4] == head)) && len <= 2) && #NULL == 0) [2022-11-25 23:29:12,441 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((data == \old(data) && !(temp == head)) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && len <= 2) && #NULL == 0) || ((((((((((((((((((((2 == len && data == \old(data)) && \valid[temp] == 1) && 1 <= \old(data)) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && #NULL == 0) [2022-11-25 23:29:12,441 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((i == 0 && \old(data) <= 3) && !(s == #memory_$Pointer$[s][4])) && 0 <= head) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && index <= 0) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && #NULL == 0) || (((((((((((((((((((((s == \result && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && len <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && \result == head) && #NULL == 0) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && !(#memory_$Pointer$[head][4] == head)) && s == 0) && #NULL == 0)) || (((((((((((((((((((((((((((((((len == data && \old(data) <= 3) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && 0 <= head) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 0) && i + 1 <= 0) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) [2022-11-25 23:29:12,441 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && len == data) && \old(data) <= 3) && 0 <= head) && 1 <= \old(data)) && i <= 0) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 0) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || ((((((((((((((((((((((((((((((((len == data && \old(data) <= 3) && 0 <= head) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) [2022-11-25 23:29:12,442 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((s == \result && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && len <= 0) && 1 <= data) && head == s) && head == head) && data == 1) && data <= 1) && data == \old(data)) && \old(len) <= 2) && len + i == new_data) && len == 2) && s == head) && \result == head) && #NULL == 0) && len * 2 == data + 1) && index == i) && head == s) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && \old(index) == i) && !(#memory_$Pointer$[head][4] == head)) && s == 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((\old(data) <= 3 && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && i == 1) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && data == len + i) && index <= 1) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || (forall v_ArrVal_399 : [int]int, v_ArrVal_402 : int :: #memory_$Pointer$[head := v_ArrVal_399][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_402][s + 4] == head))) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(#memory_$Pointer$[head][4] == head)) && 0 <= head) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || (forall v_ArrVal_405 : int, v_ArrVal_401 : [int]int :: head == #memory_$Pointer$[head := v_ArrVal_401][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_405][s + 4]))) && s == 0) && #NULL == 0)) || (((((((((((((((((((((((((((((((((\old(data) <= 3 && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && 0 <= head) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 + i <= len) && 1 <= data) && data <= 3) && index <= 0) && 0 <= i) && data == len + i) && index <= 1) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && #NULL == 0) [2022-11-25 23:29:12,443 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((index <= 0 && 2 <= unknown-#memory_int-unknown[head][head]) && 0 <= s) && \old(data) <= 3) && 0 <= head) && 1 <= \old(data)) && unknown-#memory_int-unknown[head][head] <= 2) && temp == 0) && \old(data) <= 1) && head <= 0) && len == 2 + i) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && 2 == expected) && index <= 0) && 0 <= i) && data == len + i) && index <= 1) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && len == data) && \old(data) <= 3) && 0 <= head) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 * ((unknown-#memory_int-unknown[head][head] + 1) / -2) + expected + 1 == 0) && 1 <= data) && data <= 3) && (unknown-#memory_int-unknown[head][head] + 1) % 2 == 0) && 0 <= i) && index <= 1) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && i <= 1) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((len == data && \old(data) <= 3) && 0 <= head) && \old(index) == i) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && head <= 0) && data <= 1) && \old(len) <= 2) && (unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] + 1) / -2 * 2 + expected + 1 == 0) && head == s) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && head == s) && \old(index) == index) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && head == 0) && index + 1 <= i) && head == head) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) [2022-11-25 23:29:12,462 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:29:12,462 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:29:12,463 INFO L158 Benchmark]: Toolchain (without parser) took 55873.31ms. Allocated memory was 151.0MB in the beginning and 388.0MB in the end (delta: 237.0MB). Free memory was 105.6MB in the beginning and 146.2MB in the end (delta: -40.6MB). Peak memory consumption was 198.2MB. Max. memory is 16.1GB. [2022-11-25 23:29:12,463 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:29:12,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.95ms. Allocated memory is still 151.0MB. Free memory was 105.6MB in the beginning and 88.0MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 23:29:12,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.27ms. Allocated memory is still 151.0MB. Free memory was 88.0MB in the beginning and 85.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:29:12,464 INFO L158 Benchmark]: Boogie Preprocessor took 31.42ms. Allocated memory is still 151.0MB. Free memory was 85.9MB in the beginning and 84.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:29:12,464 INFO L158 Benchmark]: RCFGBuilder took 563.32ms. Allocated memory is still 151.0MB. Free memory was 84.7MB in the beginning and 120.0MB in the end (delta: -35.4MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2022-11-25 23:29:12,465 INFO L158 Benchmark]: TraceAbstraction took 54550.55ms. Allocated memory was 151.0MB in the beginning and 388.0MB in the end (delta: 237.0MB). Free memory was 119.1MB in the beginning and 149.4MB in the end (delta: -30.3MB). Peak memory consumption was 236.1MB. Max. memory is 16.1GB. [2022-11-25 23:29:12,465 INFO L158 Benchmark]: Witness Printer took 73.46ms. Allocated memory is still 388.0MB. Free memory was 149.4MB in the beginning and 146.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:29:12,469 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.95ms. Allocated memory is still 151.0MB. Free memory was 105.6MB in the beginning and 88.0MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.27ms. Allocated memory is still 151.0MB. Free memory was 88.0MB in the beginning and 85.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.42ms. Allocated memory is still 151.0MB. Free memory was 85.9MB in the beginning and 84.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 563.32ms. Allocated memory is still 151.0MB. Free memory was 84.7MB in the beginning and 120.0MB in the end (delta: -35.4MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * TraceAbstraction took 54550.55ms. Allocated memory was 151.0MB in the beginning and 388.0MB in the end (delta: 237.0MB). Free memory was 119.1MB in the beginning and 149.4MB in the end (delta: -30.3MB). Peak memory consumption was 236.1MB. Max. memory is 16.1GB. * Witness Printer took 73.46ms. Allocated memory is still 388.0MB. Free memory was 149.4MB in the beginning and 146.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_401,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_401,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 630]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.4s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 492 mSDsluCounter, 314 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 192 IncrementalHoareTripleChecker+Unchecked, 249 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1022 IncrementalHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 65 mSDtfsCounter, 1022 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 601 GetRequests, 339 SyntacticMatches, 30 SemanticMatches, 232 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 17.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=10, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 62 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 28 NumberOfFragments, 1813 HoareAnnotationTreeSize, 10 FomulaSimplifications, 648 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 17256 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 373 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 512 ConstructedInterpolants, 6 QuantifiedInterpolants, 2973 SizeOfPredicates, 86 NumberOfNonLiveVariables, 2561 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 35 InterpolantComputations, 3 PerfectInterpolantSequences, 246/343 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 6.6s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 21, DAG_INTERPRETER_EARLY_EXITS: 4, TOOLS_POST_APPLICATIONS: 47, TOOLS_POST_TIME: 6.2s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 45, TOOLS_QUANTIFIERELIM_TIME: 6.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 1.6s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 100, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 5, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 8, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 13, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 21, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 5, LOOP_SUMMARIZER_CACHE_MISSES: 5, LOOP_SUMMARIZER_OVERALL_TIME: 6.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 6.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 13, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 298, DAG_COMPRESSION_RETAINED_NODES: 91, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 622]: Loop Invariant [2022-11-25 23:29:12,488 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,488 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,489 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,495 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,495 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,495 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,496 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,496 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && len == data) && \old(data) <= 3) && 0 <= head) && 1 <= \old(data)) && i <= 0) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 0) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || ((((((((((((((((((((((((((((((((len == data && \old(data) <= 3) && 0 <= head) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((data == \old(data) && !(temp == head)) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && len <= 2) && #NULL == 0) || ((((((((((((((((((((2 == len && data == \old(data)) && \valid[temp] == 1) && 1 <= \old(data)) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && #NULL == 0) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant [2022-11-25 23:29:12,502 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,503 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((2 == len && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && #NULL == 0)) || ((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head == 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(#memory_$Pointer$[head][4] == head)) && len <= 2) && #NULL == 0) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant [2022-11-25 23:29:12,504 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,507 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,507 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,507 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,508 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,508 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,508 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,508 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,509 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,510 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,510 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,510 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,511 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,511 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,511 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,511 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((((i == 0 && \old(data) <= 3) && !(s == #memory_$Pointer$[s][4])) && 0 <= head) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && index <= 0) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && #NULL == 0) || (((((((((((((((((((((s == \result && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && len <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && \result == head) && #NULL == 0) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && !(#memory_$Pointer$[head][4] == head)) && s == 0) && #NULL == 0)) || (((((((((((((((((((((((((((((((len == data && \old(data) <= 3) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && 0 <= head) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 0) && i + 1 <= 0) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) - InvariantResult [Line: 600]: Loop Invariant [2022-11-25 23:29:12,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,515 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,515 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,515 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,515 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,516 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,516 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,516 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,516 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,518 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,519 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,519 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,519 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,519 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,520 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,520 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,520 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,521 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,521 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,521 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,521 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((((((((((index <= 0 && 2 <= unknown-#memory_int-unknown[head][head]) && 0 <= s) && \old(data) <= 3) && 0 <= head) && 1 <= \old(data)) && unknown-#memory_int-unknown[head][head] <= 2) && temp == 0) && \old(data) <= 1) && head <= 0) && len == 2 + i) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && 2 == expected) && index <= 0) && 0 <= i) && data == len + i) && index <= 1) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && len == data) && \old(data) <= 3) && 0 <= head) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 * ((unknown-#memory_int-unknown[head][head] + 1) / -2) + expected + 1 == 0) && 1 <= data) && data <= 3) && (unknown-#memory_int-unknown[head][head] + 1) % 2 == 0) && 0 <= i) && index <= 1) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && i <= 1) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((len == data && \old(data) <= 3) && 0 <= head) && \old(index) == i) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && head <= 0) && data <= 1) && \old(len) <= 2) && (unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] + 1) / -2 * 2 + expected + 1 == 0) && head == s) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && head == s) && \old(index) == index) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && head == 0) && index + 1 <= i) && head == head) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) - InvariantResult [Line: 607]: Loop Invariant [2022-11-25 23:29:12,523 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,523 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-25 23:29:12,524 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,524 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2022-11-25 23:29:12,524 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] [2022-11-25 23:29:12,524 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-25 23:29:12,525 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,525 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-25 23:29:12,526 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,527 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_401,QUANTIFIED] [2022-11-25 23:29:12,527 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] [2022-11-25 23:29:12,527 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-25 23:29:12,527 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,532 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,533 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-25 23:29:12,533 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,533 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2022-11-25 23:29:12,533 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] [2022-11-25 23:29:12,534 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-25 23:29:12,534 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,534 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-25 23:29:12,534 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,534 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_401,QUANTIFIED] [2022-11-25 23:29:12,535 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] [2022-11-25 23:29:12,535 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-25 23:29:12,535 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:29:12,535 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:29:12,536 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((((((s == \result && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && len <= 0) && 1 <= data) && head == s) && head == head) && data == 1) && data <= 1) && data == \old(data)) && \old(len) <= 2) && len + i == new_data) && len == 2) && s == head) && \result == head) && #NULL == 0) && len * 2 == data + 1) && index == i) && head == s) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && \old(index) == i) && !(#memory_$Pointer$[head][4] == head)) && s == 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((\old(data) <= 3 && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && i == 1) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && data == len + i) && index <= 1) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || (forall v_ArrVal_399 : [int]int, v_ArrVal_402 : int :: #memory_$Pointer$[head := v_ArrVal_399][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_402][s + 4] == head))) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(#memory_$Pointer$[head][4] == head)) && 0 <= head) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || (forall v_ArrVal_405 : int, v_ArrVal_401 : [int]int :: head == #memory_$Pointer$[head := v_ArrVal_401][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_405][s + 4]))) && s == 0) && #NULL == 0)) || (((((((((((((((((((((((((((((((((\old(data) <= 3 && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && 0 <= head) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 + i <= len) && 1 <= data) && data <= 3) && index <= 0) && 0 <= i) && data == len + i) && index <= 1) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-25 23:29:12,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc95e074-ac09-4389-9094-f2608ef7706b/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE