./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P --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 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:00:51,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:00:51,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:00:51,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:00:51,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:00:51,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:00:51,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:00:51,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:00:51,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:00:51,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:00:51,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:00:51,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:00:51,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:00:51,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:00:51,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:00:51,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:00:51,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:00:51,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:00:51,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:00:51,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:00:51,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:00:51,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:00:51,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:00:51,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:00:51,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:00:51,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:00:51,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:00:51,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:00:51,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:00:51,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:00:51,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:00:51,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:00:51,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:00:51,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:00:51,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:00:51,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:00:51,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:00:51,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:00:51,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:00:51,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:00:51,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:00:51,576 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 00:00:51,630 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:00:51,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:00:51,631 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:00:51,632 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:00:51,633 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:00:51,633 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:00:51,634 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:00:51,634 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:00:51,634 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:00:51,635 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 00:00:51,636 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:00:51,636 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:00:51,637 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 00:00:51,637 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 00:00:51,637 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:00:51,638 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 00:00:51,638 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 00:00:51,638 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 00:00:51,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:00:51,639 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:00:51,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 00:00:51,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:00:51,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:00:51,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 00:00:51,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:00:51,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 00:00:51,643 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:00:51,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 00:00:51,644 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:00:51,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 00:00:51,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:00:51,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:00:51,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:00:51,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:00:51,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:00:51,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 00:00:51,646 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 00:00:51,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 00:00:51,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 00:00:51,647 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:00:51,648 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:00:51,648 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/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_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P 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 -> 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 [2021-11-21 00:00:51,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:00:52,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:00:52,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:00:52,015 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:00:52,016 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:00:52,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2021-11-21 00:00:52,100 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/data/239360dd8/fc9fb605f9204430afa92750445f949a/FLAG31f3512f9 [2021-11-21 00:00:52,751 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:00:52,752 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2021-11-21 00:00:52,767 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/data/239360dd8/fc9fb605f9204430afa92750445f949a/FLAG31f3512f9 [2021-11-21 00:00:52,983 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/data/239360dd8/fc9fb605f9204430afa92750445f949a [2021-11-21 00:00:52,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:00:52,987 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:00:52,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:00:52,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:00:52,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:00:52,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:00:52" (1/1) ... [2021-11-21 00:00:53,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405f9cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:00:52, skipping insertion in model container [2021-11-21 00:00:53,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:00:52" (1/1) ... [2021-11-21 00:00:53,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:00:53,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:00:53,549 WARN L230 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_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i[24151,24164] [2021-11-21 00:00:53,552 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:00:53,560 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:00:53,601 WARN L230 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_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i[24151,24164] [2021-11-21 00:00:53,602 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:00:53,643 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:00:53,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:00:53 WrapperNode [2021-11-21 00:00:53,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:00:53,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:00:53,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:00:53,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:00:53,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:00:53" (1/1) ... [2021-11-21 00:00:53,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:00:53" (1/1) ... [2021-11-21 00:00:53,734 INFO L137 Inliner]: procedures = 126, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 119 [2021-11-21 00:00:53,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:00:53,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:00:53,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:00:53,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:00:53,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:00:53" (1/1) ... [2021-11-21 00:00:53,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:00:53" (1/1) ... [2021-11-21 00:00:53,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:00:53" (1/1) ... [2021-11-21 00:00:53,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:00:53" (1/1) ... [2021-11-21 00:00:53,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:00:53" (1/1) ... [2021-11-21 00:00:53,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:00:53" (1/1) ... [2021-11-21 00:00:53,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:00:53" (1/1) ... [2021-11-21 00:00:53,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:00:53,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:00:53,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:00:53,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:00:53,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:00:53" (1/1) ... [2021-11-21 00:00:53,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:00:53,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:00:53,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:00:53,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:00:53,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-21 00:00:53,915 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 00:00:53,915 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 00:00:53,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 00:00:53,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:00:53,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 00:00:53,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 00:00:53,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 00:00:53,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 00:00:53,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 00:00:53,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 00:00:53,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:00:53,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:00:54,072 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:00:54,074 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:00:54,370 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:00:54,403 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:00:54,403 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-21 00:00:54,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:00:54 BoogieIcfgContainer [2021-11-21 00:00:54,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:00:54,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:00:54,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:00:54,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:00:54,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:00:52" (1/3) ... [2021-11-21 00:00:54,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41118adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:00:54, skipping insertion in model container [2021-11-21 00:00:54,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:00:53" (2/3) ... [2021-11-21 00:00:54,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41118adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:00:54, skipping insertion in model container [2021-11-21 00:00:54,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:00:54" (3/3) ... [2021-11-21 00:00:54,417 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2021-11-21 00:00:54,423 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:00:54,423 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 00:00:54,479 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:00:54,487 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 00:00:54,488 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 00:00:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:00:54,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 00:00:54,515 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:00:54,515 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:00:54,516 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:00:54,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:00:54,523 INFO L85 PathProgramCache]: Analyzing trace with hash 980108759, now seen corresponding path program 1 times [2021-11-21 00:00:54,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:00:54,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951484523] [2021-11-21 00:00:54,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:00:54,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:00:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:00:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:00:54,819 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:00:54,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951484523] [2021-11-21 00:00:54,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951484523] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:00:54,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:00:54,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 00:00:54,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297999325] [2021-11-21 00:00:54,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:00:54,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:00:54,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:00:54,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:00:54,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:00:54,864 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 00:00:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:00:54,968 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2021-11-21 00:00:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:00:54,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-21 00:00:54,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:00:54,978 INFO L225 Difference]: With dead ends: 41 [2021-11-21 00:00:54,978 INFO L226 Difference]: Without dead ends: 24 [2021-11-21 00:00:54,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:00:54,985 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:00:54,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:00:55,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-21 00:00:55,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2021-11-21 00:00:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:00:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-11-21 00:00:55,033 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 10 [2021-11-21 00:00:55,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:00:55,034 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-11-21 00:00:55,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 00:00:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2021-11-21 00:00:55,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-21 00:00:55,036 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:00:55,036 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:00:55,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 00:00:55,037 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:00:55,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:00:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1677954359, now seen corresponding path program 1 times [2021-11-21 00:00:55,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:00:55,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774460951] [2021-11-21 00:00:55,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:00:55,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:00:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:00:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-21 00:00:55,156 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:00:55,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774460951] [2021-11-21 00:00:55,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774460951] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:00:55,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:00:55,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-21 00:00:55,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657744501] [2021-11-21 00:00:55,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:00:55,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 00:00:55,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:00:55,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 00:00:55,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:00:55,162 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:00:55,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:00:55,247 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2021-11-21 00:00:55,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 00:00:55,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2021-11-21 00:00:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:00:55,250 INFO L225 Difference]: With dead ends: 34 [2021-11-21 00:00:55,250 INFO L226 Difference]: Without dead ends: 31 [2021-11-21 00:00:55,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:00:55,254 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:00:55,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 41 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:00:55,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-11-21 00:00:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2021-11-21 00:00:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:00:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2021-11-21 00:00:55,262 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 16 [2021-11-21 00:00:55,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:00:55,266 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-11-21 00:00:55,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:00:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2021-11-21 00:00:55,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-21 00:00:55,270 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:00:55,270 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:00:55,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 00:00:55,271 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:00:55,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:00:55,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1516062603, now seen corresponding path program 1 times [2021-11-21 00:00:55,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:00:55,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107276755] [2021-11-21 00:00:55,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:00:55,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:00:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:00:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-21 00:00:55,457 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:00:55,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107276755] [2021-11-21 00:00:55,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107276755] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:00:55,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724745000] [2021-11-21 00:00:55,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:00:55,458 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:00:55,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:00:55,462 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:00:55,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 00:00:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:00:55,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 00:00:55,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:00:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-21 00:00:55,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:00:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-21 00:00:55,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724745000] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:00:55,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1179731526] [2021-11-21 00:00:55,970 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-21 00:00:55,970 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 00:00:55,975 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 00:00:55,982 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 00:00:55,982 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 00:00:56,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:00:56,094 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-21 00:00:56,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2021-11-21 00:00:56,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:00:56,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:00:56,195 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-21 00:00:56,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2021-11-21 00:00:56,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-21 00:00:56,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-21 00:00:56,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:00:56,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 7 [2021-11-21 00:00:56,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:00:56,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 17 [2021-11-21 00:00:56,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:00:56,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 7 [2021-11-21 00:00:56,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:00:56,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:00:56,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 00:00:56,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:00:56,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 00:00:56,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:00:56,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:00:56,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 00:00:56,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:00:56,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 00:00:57,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:00:57,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:00:57,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:00:57,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:00:57,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:00:57,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:00:58,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:00:58,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:00:58,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:00:58,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:00:58,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-21 00:00:58,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:00:58,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 00:00:58,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 11 [2021-11-21 00:00:58,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:00:58,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:00:58,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:00:58,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:00:59,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:00:59,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:00:59,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:00:59,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:00:59,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:00:59,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:00:59,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-21 00:00:59,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:00:59,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 00:00:59,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 11 [2021-11-21 00:01:00,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:00,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:00,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:00,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:00,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:00,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:00,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:00,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:00,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:00,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:00,782 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:01:00,797 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-21 00:01:00,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2021-11-21 00:01:00,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:00,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 00:01:00,913 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:01:00,925 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-21 00:01:00,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2021-11-21 00:01:02,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:02,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 00:01:02,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:02,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2021-11-21 00:01:02,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:01:02,734 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:01:02,755 INFO L354 Elim1Store]: treesize reduction 60, result has 15.5 percent of original size [2021-11-21 00:01:02,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 41 [2021-11-21 00:01:02,775 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-11-21 00:01:02,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 32 treesize of output 29 [2021-11-21 00:01:04,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:04,534 INFO L354 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2021-11-21 00:01:04,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 34 [2021-11-21 00:01:04,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:04,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:01:04,656 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-21 00:01:04,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 45 [2021-11-21 00:01:04,691 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 00:01:04,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2021-11-21 00:01:04,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:04,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 00:01:07,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:07,094 INFO L354 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2021-11-21 00:01:07,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 45 [2021-11-21 00:01:07,118 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 00:01:07,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2021-11-21 00:01:07,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:07,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:07,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:07,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2021-11-21 00:01:07,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:07,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 00:01:09,898 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 88 for LOIs [2021-11-21 00:01:12,160 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-21 00:01:20,996 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-21 00:01:20,996 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:01:20,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-11-21 00:01:20,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775017957] [2021-11-21 00:01:20,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:01:20,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-21 00:01:20,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:01:20,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-21 00:01:21,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2021-11-21 00:01:21,001 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-21 00:01:21,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:01:21,061 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-11-21 00:01:21,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-21 00:01:21,061 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2021-11-21 00:01:21,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:01:21,063 INFO L225 Difference]: With dead ends: 35 [2021-11-21 00:01:21,063 INFO L226 Difference]: Without dead ends: 32 [2021-11-21 00:01:21,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2021-11-21 00:01:21,065 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 98 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:01:21,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 56 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:01:21,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-11-21 00:01:21,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-11-21 00:01:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:01:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2021-11-21 00:01:21,073 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 22 [2021-11-21 00:01:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:01:21,074 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2021-11-21 00:01:21,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-21 00:01:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2021-11-21 00:01:21,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-21 00:01:21,076 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:01:21,076 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:01:21,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-21 00:01:21,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:01:21,287 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:01:21,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:01:21,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1874328883, now seen corresponding path program 2 times [2021-11-21 00:01:21,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:01:21,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215457111] [2021-11-21 00:01:21,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:01:21,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:01:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:01:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-21 00:01:21,383 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:01:21,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215457111] [2021-11-21 00:01:21,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215457111] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:01:21,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:01:21,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 00:01:21,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495776298] [2021-11-21 00:01:21,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:01:21,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-21 00:01:21,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:01:21,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-21 00:01:21,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-21 00:01:21,386 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:01:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:01:21,511 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2021-11-21 00:01:21,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-21 00:01:21,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2021-11-21 00:01:21,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:01:21,515 INFO L225 Difference]: With dead ends: 46 [2021-11-21 00:01:21,515 INFO L226 Difference]: Without dead ends: 32 [2021-11-21 00:01:21,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-21 00:01:21,520 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:01:21,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 54 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:01:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-11-21 00:01:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-11-21 00:01:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:01:21,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2021-11-21 00:01:21,544 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 28 [2021-11-21 00:01:21,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:01:21,544 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-11-21 00:01:21,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:01:21,545 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2021-11-21 00:01:21,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-21 00:01:21,547 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:01:21,547 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:01:21,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-21 00:01:21,547 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:01:21,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:01:21,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2022697385, now seen corresponding path program 1 times [2021-11-21 00:01:21,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:01:21,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852699339] [2021-11-21 00:01:21,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:01:21,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:01:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:01:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-21 00:01:21,676 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:01:21,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852699339] [2021-11-21 00:01:21,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852699339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:01:21,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:01:21,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-21 00:01:21,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485993223] [2021-11-21 00:01:21,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:01:21,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 00:01:21,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:01:21,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 00:01:21,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:01:21,682 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:01:21,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:01:21,737 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2021-11-21 00:01:21,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 00:01:21,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2021-11-21 00:01:21,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:01:21,739 INFO L225 Difference]: With dead ends: 57 [2021-11-21 00:01:21,739 INFO L226 Difference]: Without dead ends: 36 [2021-11-21 00:01:21,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-21 00:01:21,749 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:01:21,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:01:21,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-11-21 00:01:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-11-21 00:01:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:01:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2021-11-21 00:01:21,754 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 34 [2021-11-21 00:01:21,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:01:21,754 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2021-11-21 00:01:21,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:01:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2021-11-21 00:01:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-21 00:01:21,755 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:01:21,756 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:01:21,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-21 00:01:21,756 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:01:21,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:01:21,757 INFO L85 PathProgramCache]: Analyzing trace with hash -839211383, now seen corresponding path program 1 times [2021-11-21 00:01:21,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:01:21,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118972958] [2021-11-21 00:01:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:01:21,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:01:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:01:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:01:22,281 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:01:22,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118972958] [2021-11-21 00:01:22,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118972958] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:01:22,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225915958] [2021-11-21 00:01:22,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:01:22,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:01:22,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:01:22,283 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:01:22,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-21 00:01:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:01:22,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 90 conjunts are in the unsatisfiable core [2021-11-21 00:01:22,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:01:23,027 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-21 00:01:23,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 71 treesize of output 53 [2021-11-21 00:01:23,041 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-21 00:01:23,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 49 [2021-11-21 00:01:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 00:01:24,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:01:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-21 00:01:25,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225915958] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:01:25,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1376044334] [2021-11-21 00:01:25,114 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2021-11-21 00:01:25,114 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 00:01:25,114 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 00:01:25,114 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 00:01:25,129 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 00:01:25,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:25,194 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-21 00:01:25,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2021-11-21 00:01:25,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:25,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:25,255 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-21 00:01:25,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2021-11-21 00:01:25,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-21 00:01:25,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-21 00:01:25,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:25,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 7 [2021-11-21 00:01:25,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:25,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 17 [2021-11-21 00:01:25,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:25,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 7 [2021-11-21 00:01:25,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:25,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 00:01:25,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:25,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:25,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 00:01:25,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:25,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:25,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 00:01:25,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:25,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 00:01:26,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:26,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:26,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:26,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:26,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:26,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:26,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:26,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:26,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:26,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:26,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-21 00:01:26,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:26,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 00:01:26,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 11 [2021-11-21 00:01:27,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:27,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:27,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:27,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:27,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:27,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:27,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:27,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:27,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:27,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:27,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:01:27,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:27,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 195 treesize of output 179 [2021-11-21 00:01:27,828 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:01:27,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 170 [2021-11-21 00:01:27,838 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:01:27,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 93 [2021-11-21 00:01:28,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:28,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:28,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:28,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:28,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:28,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:28,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:28,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:28,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:28,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:28,691 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:01:28,701 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-21 00:01:28,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2021-11-21 00:01:28,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:01:28,747 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-21 00:01:28,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2021-11-21 00:01:28,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:28,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 00:01:33,046 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-21 00:01:33,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 12 treesize of output 18 [2021-11-21 00:01:33,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:33,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:33,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:01:33,174 INFO L354 Elim1Store]: treesize reduction 120, result has 13.0 percent of original size [2021-11-21 00:01:33,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 117 treesize of output 98 [2021-11-21 00:01:33,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:33,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:33,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:01:33,244 INFO L354 Elim1Store]: treesize reduction 179, result has 9.1 percent of original size [2021-11-21 00:01:33,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 102 treesize of output 86 [2021-11-21 00:01:33,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:01:33,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:33,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 00:01:43,237 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 88 for LOIs [2021-11-21 00:01:44,939 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-21 00:01:53,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1376044334] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:01:53,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:01:53,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [15, 17, 11] total 53 [2021-11-21 00:01:53,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068453245] [2021-11-21 00:01:53,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:01:53,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-21 00:01:53,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:01:53,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-21 00:01:53,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=2457, Unknown=1, NotChecked=0, Total=2756 [2021-11-21 00:01:53,620 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 17 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:01:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:01:55,483 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2021-11-21 00:01:55,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-21 00:01:55,484 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2021-11-21 00:01:55,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:01:55,485 INFO L225 Difference]: With dead ends: 50 [2021-11-21 00:01:55,486 INFO L226 Difference]: Without dead ends: 47 [2021-11-21 00:01:55,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=330, Invalid=2749, Unknown=1, NotChecked=0, Total=3080 [2021-11-21 00:01:55,489 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:01:55,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 92 Unchecked, 0.2s Time] [2021-11-21 00:01:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-11-21 00:01:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2021-11-21 00:01:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:01:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2021-11-21 00:01:55,500 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 38 [2021-11-21 00:01:55,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:01:55,501 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2021-11-21 00:01:55,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:01:55,501 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2021-11-21 00:01:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-21 00:01:55,502 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:01:55,503 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:01:55,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-21 00:01:55,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-21 00:01:55,719 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:01:55,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:01:55,720 INFO L85 PathProgramCache]: Analyzing trace with hash -448917500, now seen corresponding path program 1 times [2021-11-21 00:01:55,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:01:55,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630874709] [2021-11-21 00:01:55,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:01:55,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:01:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:01:55,849 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-21 00:01:55,850 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:01:55,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630874709] [2021-11-21 00:01:55,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630874709] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:01:55,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539420980] [2021-11-21 00:01:55,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:01:55,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:01:55,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:01:55,852 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:01:55,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-21 00:01:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:01:55,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-21 00:01:55,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:01:56,095 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:01:56,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 48 [2021-11-21 00:01:56,104 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:01:56,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 37 [2021-11-21 00:01:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-21 00:01:56,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:01:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-21 00:01:56,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539420980] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:01:56,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [648162637] [2021-11-21 00:01:56,277 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2021-11-21 00:01:56,277 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 00:01:56,278 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 00:01:56,278 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 00:01:56,278 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 00:01:56,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:56,316 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-21 00:01:56,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2021-11-21 00:01:56,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:56,349 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-21 00:01:56,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2021-11-21 00:01:56,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-21 00:01:56,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-21 00:01:56,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:56,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 7 [2021-11-21 00:01:56,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:56,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 7 [2021-11-21 00:01:56,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:56,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 17 [2021-11-21 00:01:56,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:56,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 00:01:56,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:56,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:56,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 00:01:56,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:56,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 00:01:56,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:56,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:56,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 00:01:57,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:57,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:57,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:57,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:57,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:57,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:57,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:57,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:57,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:57,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:57,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 11 [2021-11-21 00:01:57,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-21 00:01:57,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:57,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 00:01:58,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:58,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:58,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:58,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:58,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:58,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:58,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:58,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:58,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:58,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:58,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 11 [2021-11-21 00:01:58,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:58,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 00:01:58,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-21 00:01:59,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:59,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:59,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:59,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:59,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:59,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:59,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:59,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:59,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:01:59,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:01:59,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:01:59,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 00:01:59,722 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:01:59,735 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-21 00:01:59,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2021-11-21 00:01:59,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:01:59,799 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-21 00:01:59,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2021-11-21 00:02:04,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:02:04,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:02:04,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:02:04,720 INFO L354 Elim1Store]: treesize reduction 179, result has 9.1 percent of original size [2021-11-21 00:02:04,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 117 treesize of output 101 [2021-11-21 00:02:04,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:02:04,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:02:04,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:02:04,780 INFO L354 Elim1Store]: treesize reduction 120, result has 13.0 percent of original size [2021-11-21 00:02:04,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 86 treesize of output 71 [2021-11-21 00:02:04,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:02:04,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:02:04,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 00:02:04,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:02:04,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-11-21 00:02:14,118 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 88 for LOIs [2021-11-21 00:02:16,030 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-21 00:02:24,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [648162637] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:02:24,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:02:24,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [6, 6, 6] total 22 [2021-11-21 00:02:24,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047375293] [2021-11-21 00:02:24,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:02:24,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-21 00:02:24,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:02:24,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-21 00:02:24,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2021-11-21 00:02:24,644 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 16 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:02:28,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:02:28,512 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2021-11-21 00:02:28,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-21 00:02:28,513 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2021-11-21 00:02:28,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:02:28,513 INFO L225 Difference]: With dead ends: 39 [2021-11-21 00:02:28,514 INFO L226 Difference]: Without dead ends: 0 [2021-11-21 00:02:28,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2021-11-21 00:02:28,515 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 18 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:02:28,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 16 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 154 Invalid, 0 Unknown, 62 Unchecked, 0.3s Time] [2021-11-21 00:02:28,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-21 00:02:28,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-21 00:02:28,517 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) [2021-11-21 00:02:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-21 00:02:28,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2021-11-21 00:02:28,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:02:28,518 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-21 00:02:28,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:02:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-21 00:02:28,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-21 00:02:28,522 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-21 00:02:28,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-21 00:02:28,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:02:28,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-21 00:02:31,672 INFO L858 garLoopResultBuilder]: For program point L605-1(lines 605 607) no Hoare annotation was computed. [2021-11-21 00:02:31,672 INFO L854 garLoopResultBuilder]: At program point L605-3(lines 605 607) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_sll_circular_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |ULTIMATE.start_sll_circular_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (<= |ULTIMATE.start_main_~i~0#1| 1))) (or (and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) .cse0 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_remove_last_#in~head#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= 0 |ULTIMATE.start_sll_circular_remove_last_#in~head#1.base|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) .cse1 (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse2 .cse3 (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_remove_last_~head#1.base|)) (and .cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) .cse1 .cse2 .cse3 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)))) [2021-11-21 00:02:31,672 INFO L858 garLoopResultBuilder]: For program point L605-4(lines 605 607) no Hoare annotation was computed. [2021-11-21 00:02:31,672 INFO L858 garLoopResultBuilder]: For program point L597-1(lines 597 599) no Hoare annotation was computed. [2021-11-21 00:02:31,673 INFO L854 garLoopResultBuilder]: At program point L597-3(lines 597 599) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_sll_circular_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |ULTIMATE.start_sll_circular_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (<= |ULTIMATE.start_main_~i~0#1| 1))) (or (and .cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) .cse1 .cse2 .cse3 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) .cse0 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26| Int)) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26|) |ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset|) (= |ULTIMATE.start_sll_circular_remove_last_~last~1#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26|)))) (<= 0 |ULTIMATE.start_sll_circular_remove_last_#in~head#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= 0 |ULTIMATE.start_sll_circular_remove_last_#in~head#1.base|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) .cse1 (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse2 .cse3 (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_remove_last_~head#1.base|)))) [2021-11-21 00:02:31,673 INFO L858 garLoopResultBuilder]: For program point L597-4(lines 597 599) no Hoare annotation was computed. [2021-11-21 00:02:31,673 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-21 00:02:31,673 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2021-11-21 00:02:31,674 INFO L854 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse2 (<= |#NULL.offset| 0)) (.cse3 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse4 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse5 (not (= 2 |ULTIMATE.start_main_~#s~0#1.base|))) (.cse6 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse9 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse10 (<= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse11 (<= 0 |#NULL.offset|)) (.cse12 (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (< 0 |#StackHeapBarrier|)) (.cse14 (= |#NULL.base| 0))) (or (and .cse0 (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) .cse1 (= (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) .cse2 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) .cse3 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) .cse4 .cse5 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| 0)) .cse6 .cse7 .cse8 (< |ULTIMATE.start_sll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) .cse9 .cse10 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) .cse11 .cse12 .cse13 .cse14) (and .cse0 (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) .cse1 (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2 (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) .cse3 (< |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) .cse4 .cse5 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1) .cse6 .cse7 .cse8 (= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse9 (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) .cse10 .cse11 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) .cse12 (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) .cse13 .cse14))) [2021-11-21 00:02:31,674 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-21 00:02:31,674 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 611) no Hoare annotation was computed. [2021-11-21 00:02:31,674 INFO L858 garLoopResultBuilder]: For program point L620(lines 620 622) no Hoare annotation was computed. [2021-11-21 00:02:31,674 INFO L854 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (<= |#NULL.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (not (= 2 |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| 0)) (<= |ULTIMATE.start_sll_circular_create_~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (< |ULTIMATE.start_sll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) [2021-11-21 00:02:31,674 INFO L858 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2021-11-21 00:02:31,675 INFO L858 garLoopResultBuilder]: For program point L600(lines 600 610) no Hoare annotation was computed. [2021-11-21 00:02:31,675 INFO L861 garLoopResultBuilder]: At program point L625(lines 612 626) the Hoare annotation is: true [2021-11-21 00:02:31,675 INFO L854 garLoopResultBuilder]: At program point L621(lines 612 626) the Hoare annotation is: false [2021-11-21 00:02:31,675 INFO L854 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_#in~data#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= 2 (select |#length| 1)) (= |ULTIMATE.start_sll_circular_create_#in~len#1| |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= 27 (select |#length| 2)) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2021-11-21 00:02:31,675 INFO L858 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2021-11-21 00:02:31,675 INFO L854 garLoopResultBuilder]: At program point L617-3(lines 617 619) the Hoare annotation is: (let ((.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse6 (<= 0 |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse7 (<= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (<= 0 |#NULL.base|)) (.cse9 (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|)) (.cse10 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse11 (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse12 (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|)) (.cse13 (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse14 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse15 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|))) (.cse16 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2)) (.cse17 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse18 (<= |#NULL.offset| 0)) (.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse19 (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (.cse20 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse21 (< |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|)) (.cse22 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse23 (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| 0))) (.cse24 (<= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse25 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse26 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|))) (.cse27 (not (= 2 |ULTIMATE.start_main_~#s~0#1.base|))) (.cse28 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse29 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)) (.cse30 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (.cse31 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse32 (<= |#NULL.base| 0)) (.cse33 (= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (.cse34 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse35 (<= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse36 (= |ULTIMATE.start_sll_circular_create_#res#1.base| .cse3)) (.cse37 (<= 0 |#NULL.offset|)) (.cse38 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse2 (= |ULTIMATE.start_sll_circular_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse39 (<= 1 |ULTIMATE.start_main_~data~0#1|)) (.cse40 (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse41 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_sll_circular_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 0) .cse1 .cse2 (= .cse3 0)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) .cse10 .cse11 .cse12 .cse13 (= .cse0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse1 (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) .cse41) (and .cse4 .cse5 .cse6 (<= 0 |ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset|) .cse7 .cse8 .cse9 (<= 2 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= 0 (select |#valid| |ULTIMATE.start_sll_circular_remove_last_~last~1#1.base|)) .cse10 .cse11 .cse12 .cse13 (<= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.offset|) (= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_remove_last_#in~head#1.offset|) (<= |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.offset| 0) .cse14 (= |ULTIMATE.start_main_~i~0#1| 1) .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_main_~len~0#1| 2) (= .cse0 |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.offset|) .cse19 .cse20 .cse21 .cse22 .cse23 (<= |ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset| 0) (= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.base| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_remove_last_~last~1#1.base|) .cse33 .cse34 .cse35 .cse36 .cse37 (= |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) .cse38 .cse2 .cse39 .cse40 .cse41)))) [2021-11-21 00:02:31,676 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2021-11-21 00:02:31,676 INFO L861 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2021-11-21 00:02:31,676 INFO L854 garLoopResultBuilder]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (or (not (<= 0 |#NULL.offset|)) (let ((.cse0 (not (< 0 |#StackHeapBarrier|)))) (and (or .cse0 (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_19| Int)) (let ((.cse1 (select (select |old(#memory_int)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_19|) 4))) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_19|) 0) 0)) (not (= .cse1 |node_create_#in~data#1|)) (not (<= 1 .cse1)) (= |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_19| 0) (not (<= .cse1 1)) (not (< |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_19| |#StackHeapBarrier|)) (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_19|) 0) 0)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_19|) 1)) (not (= (select |old(#length)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_19|) 8)))))) (let ((.cse2 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) .cse0 (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_32| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_32|) 1)) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_32|)) (not (= (select |old(#length)| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_32|) 4)))) (not (= |node_create_#in~data#1| 1)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse2 0) 48)) (not (= (select |old(#valid)| 0) 0)) (not (= (select .cse2 1) 0)))))) (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (<= |#NULL.base| 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2021-11-21 00:02:31,676 INFO L858 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2021-11-21 00:02:31,679 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2021-11-21 00:02:31,681 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 00:02:31,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26,QUANTIFIED] [2021-11-21 00:02:31,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26,QUANTIFIED] [2021-11-21 00:02:31,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26,QUANTIFIED] [2021-11-21 00:02:31,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26,QUANTIFIED] [2021-11-21 00:02:31,704 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,704 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,705 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26,QUANTIFIED] [2021-11-21 00:02:31,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26,QUANTIFIED] [2021-11-21 00:02:31,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26,QUANTIFIED] [2021-11-21 00:02:31,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26,QUANTIFIED] [2021-11-21 00:02:31,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,713 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,717 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,718 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,718 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,722 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,725 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,725 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,726 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,726 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,727 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,727 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,728 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,728 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,737 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,737 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 12:02:31 BoogieIcfgContainer [2021-11-21 00:02:31,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 00:02:31,753 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 00:02:31,753 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 00:02:31,753 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 00:02:31,754 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:00:54" (3/4) ... [2021-11-21 00:02:31,757 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-21 00:02:31,764 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2021-11-21 00:02:31,770 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-11-21 00:02:31,771 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-11-21 00:02:31,772 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-21 00:02:31,772 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-21 00:02:31,800 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < s && 2 == len) && #memory_$Pointer$[head][0] == 0) && \old(data) <= 1) && unknown-#length-unknown[head] == 8) && #NULL <= 0) && \valid[head] == 1) && head == last) && 1 <= data) && 0 <= head) && unknown-#memory_int-unknown[head][4] == data) && 1 <= \old(data)) && !(2 == s)) && !(head == 0)) && len == \old(len)) && data == 1) && data <= 1) && head < unknown-#StackHeapBarrier-unknown) && head == last) && head <= 0) && len == 2) && s <= 0) && #memory_$Pointer$[head][0] == 0) && 0 <= #NULL) && 0 <= s) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < s && new_head < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[new_head][new_head] == last) && \old(data) <= 1) && unknown-#memory_int-unknown[new_head][4] == data) && 1 <= len) && last <= 0) && head == new_head) && #NULL <= 0) && 0 <= last) && 1 <= data) && last < unknown-#StackHeapBarrier-unknown) && !(last == 0)) && 1 <= \old(data)) && !(2 == s)) && len <= 1) && \valid[new_head] == 1) && len == \old(len)) && data == 1) && data <= 1) && 8 == unknown-#length-unknown[new_head]) && head == new_head) && len == 2) && !(new_head == 0)) && s <= 0) && 0 <= #NULL) && new_head == 0) && 0 <= s) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2021-11-21 00:02:31,801 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((head == s && #memory_$Pointer$[s][s] == 0) && len == 2) && head == s) && #memory_$Pointer$[s][s] == 0) || (((((((((((((((((((((((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < s && 2 <= \old(len)) && 0 <= new_head) && data <= 1) && 0 <= #NULL) && new_head < unknown-#StackHeapBarrier-unknown) && i == 0) && #memory_$Pointer$[new_head][new_head] == last) && \old(data) <= 1) && unknown-#memory_int-unknown[new_head][4] == data) && 1 <= len) && last <= 0) && #memory_$Pointer$[s][s] == \result) && \result <= 0) && head == #memory_$Pointer$[last][last]) && \old(len) <= 2) && head == new_head) && #NULL <= 0) && 0 <= last) && 1 <= data) && last < unknown-#StackHeapBarrier-unknown) && 0 <= head) && !(last == 0)) && new_head <= 0) && 1 <= \old(data)) && head == #memory_$Pointer$[last][last]) && !(2 == s)) && len <= 1) && \valid[new_head] == 1) && head == \result) && data <= 1) && #NULL <= 0) && 8 == unknown-#length-unknown[new_head]) && head <= 0) && len == 2) && !(new_head == 0)) && s <= 0) && \result == #memory_$Pointer$[s][s]) && 0 <= #NULL) && 0 <= \result) && 1 <= data) && 0 <= s) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown)) || (((((((((((((((((((((((((((((((((((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < s && 2 <= \old(len)) && 0 <= new_head) && 0 <= last) && data <= 1) && 0 <= #NULL) && new_head < unknown-#StackHeapBarrier-unknown) && 2 <= len) && snd_to_last == #memory_$Pointer$[snd_to_last][snd_to_last]) && #memory_$Pointer$[snd_to_last][snd_to_last] == \result) && 0 == \valid[last]) && \old(data) <= 1) && unknown-#memory_int-unknown[new_head][4] == data) && 1 <= len) && last <= 0) && head <= 0) && 0 <= snd_to_last) && head == s) && 0 <= head) && snd_to_last <= 0) && \result <= 0) && i == 1) && head == #memory_$Pointer$[last][last]) && \old(len) <= 2) && head == new_head) && #NULL <= 0) && len <= 2) && #memory_$Pointer$[s][s] == snd_to_last) && 0 <= last) && 1 <= data) && last < unknown-#StackHeapBarrier-unknown) && 0 <= head) && !(last == 0)) && last <= 0) && head == head) && new_head <= 0) && 1 <= \old(data)) && head == #memory_$Pointer$[last][last]) && !(2 == s)) && len <= 1) && \valid[new_head] == 1) && head == \result) && data <= 1) && #NULL <= 0) && last == last) && 8 == unknown-#length-unknown[new_head]) && head <= 0) && s <= 0) && \result == #memory_$Pointer$[s][s]) && 0 <= #NULL) && snd_to_last == \result) && 0 <= \result) && head == s) && 1 <= data) && 0 <= s) && 0 < unknown-#StackHeapBarrier-unknown) [2021-11-21 00:02:31,802 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((head == s && #memory_$Pointer$[s][s] == 0) && len == 2) && head == s) && i <= 1) && #memory_$Pointer$[s][s] == 0) || ((((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= new_head) && data <= 1) && 0 <= #NULL) && head == s) && \old(data) <= 1) && 1 <= len) && last <= 0) && head <= 0) && (\exists v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26 : int, v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26 : int :: #memory_$Pointer$[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26][v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26] == last && last == #memory_$Pointer$[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26][v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26])) && 0 <= head) && \result <= 0) && \old(len) <= 2) && #NULL <= 0) && 0 <= last) && 1 <= data) && 0 <= head) && new_head <= 0) && 1 <= \old(data)) && 0 <= head) && 0 <= i) && len <= 1) && data <= 1) && #NULL <= 0) && head <= 0) && len == 2) && s <= 0) && 0 <= #NULL) && 0 <= \result) && head == s) && i <= 1) && 1 <= data) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= s) && 0 <= head) [2021-11-21 00:02:31,803 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= new_head) && data <= 1) && 0 <= #NULL) && head == s) && \old(data) <= 1) && 1 <= len) && last <= 0) && head <= 0) && 0 <= head) && \result <= 0) && \old(len) <= 2) && #NULL <= 0) && 0 <= last) && 1 <= data) && 0 <= head) && new_head <= 0) && 1 <= \old(data)) && 0 <= head) && 0 <= i) && len <= 1) && data <= 1) && #NULL <= 0) && head <= 0) && len == 2) && s <= 0) && 0 <= #NULL) && 0 <= \result) && head == s) && i <= 1) && 1 <= data) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= s) && 0 <= head) || (((((head == s && #memory_$Pointer$[s][s] == 0) && len == 2) && head == s) && i <= 1) && #memory_$Pointer$[s][s] == 0) [2021-11-21 00:02:31,824 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/witness.graphml [2021-11-21 00:02:31,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 00:02:31,826 INFO L158 Benchmark]: Toolchain (without parser) took 98838.34ms. Allocated memory was 111.1MB in the beginning and 268.4MB in the end (delta: 157.3MB). Free memory was 80.4MB in the beginning and 146.8MB in the end (delta: -66.4MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. [2021-11-21 00:02:31,827 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 111.1MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:02:31,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 653.32ms. Allocated memory is still 111.1MB. Free memory was 80.4MB in the beginning and 78.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-21 00:02:31,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.48ms. Allocated memory is still 111.1MB. Free memory was 78.9MB in the beginning and 77.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:02:31,829 INFO L158 Benchmark]: Boogie Preprocessor took 40.78ms. Allocated memory is still 111.1MB. Free memory was 76.6MB in the beginning and 75.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:02:31,829 INFO L158 Benchmark]: RCFGBuilder took 628.97ms. Allocated memory is still 111.1MB. Free memory was 75.2MB in the beginning and 60.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-21 00:02:31,830 INFO L158 Benchmark]: TraceAbstraction took 97343.40ms. Allocated memory was 111.1MB in the beginning and 268.4MB in the end (delta: 157.3MB). Free memory was 60.2MB in the beginning and 151.0MB in the end (delta: -90.8MB). Peak memory consumption was 141.3MB. Max. memory is 16.1GB. [2021-11-21 00:02:31,830 INFO L158 Benchmark]: Witness Printer took 72.00ms. Allocated memory is still 268.4MB. Free memory was 151.0MB in the beginning and 146.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-21 00:02:31,832 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.34ms. Allocated memory is still 111.1MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 653.32ms. Allocated memory is still 111.1MB. Free memory was 80.4MB in the beginning and 78.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.48ms. Allocated memory is still 111.1MB. Free memory was 78.9MB in the beginning and 77.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.78ms. Allocated memory is still 111.1MB. Free memory was 76.6MB in the beginning and 75.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 628.97ms. Allocated memory is still 111.1MB. Free memory was 75.2MB in the beginning and 60.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 97343.40ms. Allocated memory was 111.1MB in the beginning and 268.4MB in the end (delta: 157.3MB). Free memory was 60.2MB in the beginning and 151.0MB in the end (delta: -90.8MB). Peak memory consumption was 141.3MB. Max. memory is 16.1GB. * Witness Printer took 72.00ms. Allocated memory is still 268.4MB. Free memory was 151.0MB in the beginning and 146.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26,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_circular_remove_last_~last~1#1.base_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26,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_circular_remove_last_~last~1#1.base_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26,QUANTIFIED] - 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$.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$.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$.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$.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$.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 * 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: 624]: 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 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 97.2s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 154 IncrementalHoareTripleChecker+Unchecked, 220 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 446 IncrementalHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 108 mSDtfsCounter, 446 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 32.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=6, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 12 PreInvPairs, 28 NumberOfFragments, 1252 HoareAnnotationTreeSize, 12 FomulaSimplifications, 184 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 3049 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 375 ConstructedInterpolants, 8 QuantifiedInterpolants, 5006 SizeOfPredicates, 30 NumberOfNonLiveVariables, 754 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 174/208 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: 39.6s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 42, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 106, TOOLS_POST_TIME: 34.6s, TOOLS_POST_CALL_APPLICATIONS: 20, TOOLS_POST_CALL_TIME: 1.3s, TOOLS_POST_RETURN_APPLICATIONS: 16, TOOLS_POST_RETURN_TIME: 3.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 132, TOOLS_QUANTIFIERELIM_TIME: 39.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 2.8s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 223, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 26, DOMAIN_JOIN_TIME: 0.3s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 7, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 20, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 42, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 13, LOOP_SUMMARIZER_CACHE_MISSES: 13, LOOP_SUMMARIZER_OVERALL_TIME: 16.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 16.5s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 20, CALL_SUMMARIZER_APPLICATIONS: 16, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.2s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, 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: 1018, DAG_COMPRESSION_RETAINED_NODES: 174, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 597]: Loop Invariant [2021-11-21 00:02:31,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,854 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,854 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26,QUANTIFIED] [2021-11-21 00:02:31,854 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26,QUANTIFIED] [2021-11-21 00:02:31,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,855 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26,QUANTIFIED] [2021-11-21 00:02:31,855 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26,QUANTIFIED] [2021-11-21 00:02:31,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,859 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26,QUANTIFIED] [2021-11-21 00:02:31,859 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26,QUANTIFIED] [2021-11-21 00:02:31,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,860 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26,QUANTIFIED] [2021-11-21 00:02:31,860 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26,QUANTIFIED] Derived loop invariant: (((((head == s && #memory_$Pointer$[s][s] == 0) && len == 2) && head == s) && i <= 1) && #memory_$Pointer$[s][s] == 0) || ((((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= new_head) && data <= 1) && 0 <= #NULL) && head == s) && \old(data) <= 1) && 1 <= len) && last <= 0) && head <= 0) && (\exists v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26 : int, v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26 : int :: #memory_$Pointer$[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26][v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26] == last && last == #memory_$Pointer$[v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_26][v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_26])) && 0 <= head) && \result <= 0) && \old(len) <= 2) && #NULL <= 0) && 0 <= last) && 1 <= data) && 0 <= head) && new_head <= 0) && 1 <= \old(data)) && 0 <= head) && 0 <= i) && len <= 1) && data <= 1) && #NULL <= 0) && head <= 0) && len == 2) && s <= 0) && 0 <= #NULL) && 0 <= \result) && head == s) && i <= 1) && 1 <= data) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= s) && 0 <= head) - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant [2021-11-21 00:02:31,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < s && 2 == len) && #memory_$Pointer$[head][0] == 0) && \old(data) <= 1) && unknown-#length-unknown[head] == 8) && #NULL <= 0) && \valid[head] == 1) && head == last) && 1 <= data) && 0 <= head) && unknown-#memory_int-unknown[head][4] == data) && 1 <= \old(data)) && !(2 == s)) && !(head == 0)) && len == \old(len)) && data == 1) && data <= 1) && head < unknown-#StackHeapBarrier-unknown) && head == last) && head <= 0) && len == 2) && s <= 0) && #memory_$Pointer$[head][0] == 0) && 0 <= #NULL) && 0 <= s) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < s && new_head < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[new_head][new_head] == last) && \old(data) <= 1) && unknown-#memory_int-unknown[new_head][4] == data) && 1 <= len) && last <= 0) && head == new_head) && #NULL <= 0) && 0 <= last) && 1 <= data) && last < unknown-#StackHeapBarrier-unknown) && !(last == 0)) && 1 <= \old(data)) && !(2 == s)) && len <= 1) && \valid[new_head] == 1) && len == \old(len)) && data == 1) && data <= 1) && 8 == unknown-#length-unknown[new_head]) && head == new_head) && len == 2) && !(new_head == 0)) && s <= 0) && 0 <= #NULL) && new_head == 0) && 0 <= s) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 617]: Loop Invariant [2021-11-21 00:02:31,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((head == s && #memory_$Pointer$[s][s] == 0) && len == 2) && head == s) && #memory_$Pointer$[s][s] == 0) || (((((((((((((((((((((((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < s && 2 <= \old(len)) && 0 <= new_head) && data <= 1) && 0 <= #NULL) && new_head < unknown-#StackHeapBarrier-unknown) && i == 0) && #memory_$Pointer$[new_head][new_head] == last) && \old(data) <= 1) && unknown-#memory_int-unknown[new_head][4] == data) && 1 <= len) && last <= 0) && #memory_$Pointer$[s][s] == \result) && \result <= 0) && head == #memory_$Pointer$[last][last]) && \old(len) <= 2) && head == new_head) && #NULL <= 0) && 0 <= last) && 1 <= data) && last < unknown-#StackHeapBarrier-unknown) && 0 <= head) && !(last == 0)) && new_head <= 0) && 1 <= \old(data)) && head == #memory_$Pointer$[last][last]) && !(2 == s)) && len <= 1) && \valid[new_head] == 1) && head == \result) && data <= 1) && #NULL <= 0) && 8 == unknown-#length-unknown[new_head]) && head <= 0) && len == 2) && !(new_head == 0)) && s <= 0) && \result == #memory_$Pointer$[s][s]) && 0 <= #NULL) && 0 <= \result) && 1 <= data) && 0 <= s) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown)) || (((((((((((((((((((((((((((((((((((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < s && 2 <= \old(len)) && 0 <= new_head) && 0 <= last) && data <= 1) && 0 <= #NULL) && new_head < unknown-#StackHeapBarrier-unknown) && 2 <= len) && snd_to_last == #memory_$Pointer$[snd_to_last][snd_to_last]) && #memory_$Pointer$[snd_to_last][snd_to_last] == \result) && 0 == \valid[last]) && \old(data) <= 1) && unknown-#memory_int-unknown[new_head][4] == data) && 1 <= len) && last <= 0) && head <= 0) && 0 <= snd_to_last) && head == s) && 0 <= head) && snd_to_last <= 0) && \result <= 0) && i == 1) && head == #memory_$Pointer$[last][last]) && \old(len) <= 2) && head == new_head) && #NULL <= 0) && len <= 2) && #memory_$Pointer$[s][s] == snd_to_last) && 0 <= last) && 1 <= data) && last < unknown-#StackHeapBarrier-unknown) && 0 <= head) && !(last == 0)) && last <= 0) && head == head) && new_head <= 0) && 1 <= \old(data)) && head == #memory_$Pointer$[last][last]) && !(2 == s)) && len <= 1) && \valid[new_head] == 1) && head == \result) && data <= 1) && #NULL <= 0) && last == last) && 8 == unknown-#length-unknown[new_head]) && head <= 0) && s <= 0) && \result == #memory_$Pointer$[s][s]) && 0 <= #NULL) && snd_to_last == \result) && 0 <= \result) && head == s) && 1 <= data) && 0 <= s) && 0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 605]: Loop Invariant [2021-11-21 00:02:31,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-21 00:02:31,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-21 00:02:31,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= new_head) && data <= 1) && 0 <= #NULL) && head == s) && \old(data) <= 1) && 1 <= len) && last <= 0) && head <= 0) && 0 <= head) && \result <= 0) && \old(len) <= 2) && #NULL <= 0) && 0 <= last) && 1 <= data) && 0 <= head) && new_head <= 0) && 1 <= \old(data)) && 0 <= head) && 0 <= i) && len <= 1) && data <= 1) && #NULL <= 0) && head <= 0) && len == 2) && s <= 0) && 0 <= #NULL) && 0 <= \result) && head == s) && i <= 1) && 1 <= data) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= s) && 0 <= head) || (((((head == s && #memory_$Pointer$[s][s] == 0) && len == 2) && head == s) && i <= 1) && #memory_$Pointer$[s][s] == 0) RESULT: Ultimate proved your program to be correct! [2021-11-21 00:02:31,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b94938e-cc12-4dbe-8d99-2ab4a27a50f6/bin/utaipan-TEXQjIfE4P/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