./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 33e42f4b3b45c436d08f92209409517a203ca824 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:18:59,879 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:18:59,880 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:18:59,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:18:59,890 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:18:59,891 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:18:59,891 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:18:59,893 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:18:59,894 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:18:59,894 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:18:59,895 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:18:59,895 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:18:59,896 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:18:59,896 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:18:59,897 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:18:59,898 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:18:59,898 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:18:59,900 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:18:59,901 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:18:59,902 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:18:59,903 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:18:59,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:18:59,905 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:18:59,906 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:18:59,906 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:18:59,907 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:18:59,907 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:18:59,908 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:18:59,908 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:18:59,909 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:18:59,909 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:18:59,910 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:18:59,910 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:18:59,910 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:18:59,911 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:18:59,911 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:18:59,912 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 16:18:59,922 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:18:59,922 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:18:59,923 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:18:59,923 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 16:18:59,923 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 16:18:59,923 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 16:18:59,923 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 16:18:59,924 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 16:18:59,924 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 16:18:59,924 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 16:18:59,924 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 16:18:59,924 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 16:18:59,924 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 16:18:59,925 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:18:59,925 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:18:59,925 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:18:59,925 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:18:59,925 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:18:59,926 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:18:59,926 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:18:59,926 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:18:59,926 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:18:59,926 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:18:59,926 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:18:59,926 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:18:59,927 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:18:59,927 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:18:59,927 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:18:59,927 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:18:59,927 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:18:59,927 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:18:59,927 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:18:59,928 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:18:59,928 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 16:18:59,928 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:18:59,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:18:59,928 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 16:18:59,928 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan 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(__VERIFIER_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 -> 33e42f4b3b45c436d08f92209409517a203ca824 [2018-11-18 16:18:59,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:18:59,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:18:59,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:18:59,962 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:18:59,962 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:18:59,962 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-18 16:18:59,997 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/data/91795909e/fcf81c675cfd4a3d8545e7121b157eda/FLAGc97c20ffa [2018-11-18 16:19:00,348 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:19:00,348 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-18 16:19:00,355 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/data/91795909e/fcf81c675cfd4a3d8545e7121b157eda/FLAGc97c20ffa [2018-11-18 16:19:00,363 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/data/91795909e/fcf81c675cfd4a3d8545e7121b157eda [2018-11-18 16:19:00,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:19:00,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:19:00,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:19:00,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:19:00,369 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:19:00,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:19:00" (1/1) ... [2018-11-18 16:19:00,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26dc4e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:00, skipping insertion in model container [2018-11-18 16:19:00,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:19:00" (1/1) ... [2018-11-18 16:19:00,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:19:00,407 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:19:00,608 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:19:00,616 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:19:00,702 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:19:00,734 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:19:00,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:00 WrapperNode [2018-11-18 16:19:00,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:19:00,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:19:00,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:19:00,735 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:19:00,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:00" (1/1) ... [2018-11-18 16:19:00,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:00" (1/1) ... [2018-11-18 16:19:00,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:19:00,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:19:00,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:19:00,763 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:19:00,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:00" (1/1) ... [2018-11-18 16:19:00,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:00" (1/1) ... [2018-11-18 16:19:00,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:00" (1/1) ... [2018-11-18 16:19:00,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:00" (1/1) ... [2018-11-18 16:19:00,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:00" (1/1) ... [2018-11-18 16:19:00,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:00" (1/1) ... [2018-11-18 16:19:00,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:00" (1/1) ... [2018-11-18 16:19:00,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:19:00,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:19:00,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:19:00,793 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:19:00,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:19:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:19:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 16:19:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 16:19:00,840 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 16:19:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 16:19:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 16:19:00,840 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 16:19:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:19:00,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:19:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:19:00,840 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:19:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2018-11-18 16:19:00,840 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2018-11-18 16:19:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 16:19:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 16:19:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-11-18 16:19:00,841 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-11-18 16:19:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:19:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-11-18 16:19:00,841 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-11-18 16:19:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2018-11-18 16:19:00,841 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2018-11-18 16:19:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:19:00,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:19:01,109 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:19:01,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:19:01 BoogieIcfgContainer [2018-11-18 16:19:01,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:19:01,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:19:01,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:19:01,113 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:19:01,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:19:00" (1/3) ... [2018-11-18 16:19:01,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3bb0c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:19:01, skipping insertion in model container [2018-11-18 16:19:01,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:00" (2/3) ... [2018-11-18 16:19:01,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3bb0c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:19:01, skipping insertion in model container [2018-11-18 16:19:01,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:19:01" (3/3) ... [2018-11-18 16:19:01,116 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-18 16:19:01,124 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:19:01,131 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:19:01,145 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:19:01,173 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:19:01,173 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:19:01,173 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:19:01,173 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:19:01,173 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:19:01,174 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:19:01,174 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:19:01,174 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:19:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-11-18 16:19:01,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 16:19:01,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:01,196 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:19:01,198 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:01,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:01,203 INFO L82 PathProgramCache]: Analyzing trace with hash 617752042, now seen corresponding path program 1 times [2018-11-18 16:19:01,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:19:01,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:01,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:01,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:01,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:19:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:19:01,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:01,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:19:01,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:19:01,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 16:19:01,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 16:19:01,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:19:01,348 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-11-18 16:19:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:01,367 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2018-11-18 16:19:01,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:19:01,368 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2018-11-18 16:19:01,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:01,373 INFO L225 Difference]: With dead ends: 106 [2018-11-18 16:19:01,374 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 16:19:01,376 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:19:01,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 16:19:01,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-18 16:19:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 16:19:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-11-18 16:19:01,407 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 33 [2018-11-18 16:19:01,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:01,408 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-11-18 16:19:01,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 16:19:01,408 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-18 16:19:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 16:19:01,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:01,409 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:19:01,410 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:01,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:01,410 INFO L82 PathProgramCache]: Analyzing trace with hash -340774018, now seen corresponding path program 1 times [2018-11-18 16:19:01,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:19:01,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:01,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:01,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:01,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:19:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:19:01,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:01,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:19:01,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:19:01,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:19:01,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:19:01,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:19:01,477 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 4 states. [2018-11-18 16:19:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:01,535 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-11-18 16:19:01,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:19:01,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-18 16:19:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:01,536 INFO L225 Difference]: With dead ends: 75 [2018-11-18 16:19:01,536 INFO L226 Difference]: Without dead ends: 60 [2018-11-18 16:19:01,537 INFO L604 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 [2018-11-18 16:19:01,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-18 16:19:01,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2018-11-18 16:19:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 16:19:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-18 16:19:01,543 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 36 [2018-11-18 16:19:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:01,544 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-18 16:19:01,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:19:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-18 16:19:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 16:19:01,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:01,545 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:19:01,545 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:01,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:01,546 INFO L82 PathProgramCache]: Analyzing trace with hash 888481170, now seen corresponding path program 1 times [2018-11-18 16:19:01,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:19:01,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:01,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:01,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:01,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:19:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:19:01,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:01,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:19:01,619 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:19:01,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:19:01,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:19:01,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:19:01,620 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-11-18 16:19:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:01,691 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-18 16:19:01,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:19:01,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-18 16:19:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:01,692 INFO L225 Difference]: With dead ends: 85 [2018-11-18 16:19:01,693 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 16:19:01,693 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:19:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 16:19:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-18 16:19:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 16:19:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-18 16:19:01,698 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 46 [2018-11-18 16:19:01,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:01,699 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-18 16:19:01,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:19:01,699 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-18 16:19:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 16:19:01,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:01,700 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:19:01,700 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:01,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:01,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2105645987, now seen corresponding path program 1 times [2018-11-18 16:19:01,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:19:01,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:01,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:01,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:01,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:19:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 16:19:01,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:19:01,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:19:01,774 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-18 16:19:01,775 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [15], [16], [18], [22], [25], [27], [30], [34], [38], [43], [45], [48], [58], [61], [65], [69], [75], [76], [81], [82], [83], [85], [89], [93], [95], [97], [101], [102], [128], [134], [136], [137], [138], [139], [140], [141], [142], [143], [146], [147], [148], [149], [150], [151], [152] [2018-11-18 16:19:01,799 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:19:01,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:19:02,001 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:19:02,003 INFO L272 AbstractInterpreter]: Visited 32 different actions 59 times. Merged at 7 different actions 11 times. Never widened. Performed 526 root evaluator evaluations with a maximum evaluation depth of 4. Performed 526 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-11-18 16:19:02,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:02,009 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:19:02,105 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 82.49% of their original sizes. [2018-11-18 16:19:02,105 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:19:02,300 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-18 16:19:02,300 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:19:02,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:19:02,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [5] total 23 [2018-11-18 16:19:02,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:19:02,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 16:19:02,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 16:19:02,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-11-18 16:19:02,302 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 20 states. [2018-11-18 16:19:03,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:03,800 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-11-18 16:19:03,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 16:19:03,800 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-11-18 16:19:03,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:03,801 INFO L225 Difference]: With dead ends: 97 [2018-11-18 16:19:03,801 INFO L226 Difference]: Without dead ends: 72 [2018-11-18 16:19:03,802 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2018-11-18 16:19:03,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-18 16:19:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2018-11-18 16:19:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-18 16:19:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-11-18 16:19:03,810 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 55 [2018-11-18 16:19:03,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:03,811 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-11-18 16:19:03,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 16:19:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-11-18 16:19:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 16:19:03,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:03,812 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:19:03,814 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:03,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:03,814 INFO L82 PathProgramCache]: Analyzing trace with hash 270391741, now seen corresponding path program 1 times [2018-11-18 16:19:03,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:19:03,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:03,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:03,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:03,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:19:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:19:03,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:19:03,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:19:03,874 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-18 16:19:03,874 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [15], [16], [18], [22], [25], [27], [30], [34], [38], [43], [45], [48], [58], [61], [65], [69], [71], [75], [76], [81], [82], [83], [85], [89], [93], [95], [97], [101], [102], [128], [134], [136], [137], [138], [139], [140], [141], [142], [143], [146], [147], [148], [149], [150], [151], [152] [2018-11-18 16:19:03,875 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:19:03,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:19:03,956 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:19:03,956 INFO L272 AbstractInterpreter]: Visited 44 different actions 122 times. Merged at 16 different actions 35 times. Never widened. Performed 872 root evaluator evaluations with a maximum evaluation depth of 4. Performed 872 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 6 different actions. Largest state had 31 variables. [2018-11-18 16:19:03,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:03,958 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:19:04,007 INFO L227 lantSequenceWeakener]: Weakened 31 states. On average, predicates are now at 89.36% of their original sizes. [2018-11-18 16:19:04,007 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:19:04,166 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-18 16:19:04,166 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:19:04,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:19:04,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [5] total 23 [2018-11-18 16:19:04,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:19:04,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 16:19:04,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 16:19:04,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-11-18 16:19:04,168 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 20 states. [2018-11-18 16:19:05,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:05,070 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-11-18 16:19:05,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 16:19:05,071 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2018-11-18 16:19:05,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:05,072 INFO L225 Difference]: With dead ends: 94 [2018-11-18 16:19:05,072 INFO L226 Difference]: Without dead ends: 80 [2018-11-18 16:19:05,072 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2018-11-18 16:19:05,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-18 16:19:05,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2018-11-18 16:19:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 16:19:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-11-18 16:19:05,081 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 57 [2018-11-18 16:19:05,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:05,082 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-11-18 16:19:05,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 16:19:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-11-18 16:19:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 16:19:05,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:05,083 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:19:05,083 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:05,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:05,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1239611459, now seen corresponding path program 1 times [2018-11-18 16:19:05,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:19:05,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:05,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:05,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:05,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:19:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 16:19:05,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:19:05,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:19:05,135 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-11-18 16:19:05,135 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [10], [14], [15], [16], [18], [22], [25], [27], [30], [34], [38], [43], [45], [48], [58], [61], [65], [69], [71], [75], [76], [81], [82], [83], [85], [89], [93], [95], [97], [101], [102], [128], [134], [136], [137], [138], [139], [140], [141], [142], [143], [146], [147], [148], [149], [150], [151], [152] [2018-11-18 16:19:05,137 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:19:05,137 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:19:05,188 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:19:05,188 INFO L272 AbstractInterpreter]: Visited 51 different actions 134 times. Merged at 26 different actions 40 times. Never widened. Performed 887 root evaluator evaluations with a maximum evaluation depth of 4. Performed 887 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 6 different actions. Largest state had 31 variables. [2018-11-18 16:19:05,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:05,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:19:05,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:19:05,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:19:05,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:05,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:19:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:05,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:19:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 16:19:05,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:19:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 16:19:05,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:19:05,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-11-18 16:19:05,365 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:19:05,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:19:05,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:19:05,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:19:05,366 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 5 states. [2018-11-18 16:19:05,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:05,402 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-11-18 16:19:05,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:19:05,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-11-18 16:19:05,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:05,404 INFO L225 Difference]: With dead ends: 108 [2018-11-18 16:19:05,404 INFO L226 Difference]: Without dead ends: 82 [2018-11-18 16:19:05,404 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:19:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-18 16:19:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2018-11-18 16:19:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-18 16:19:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-11-18 16:19:05,413 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 59 [2018-11-18 16:19:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:05,413 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-11-18 16:19:05,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:19:05,414 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-11-18 16:19:05,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 16:19:05,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:05,415 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:19:05,415 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:05,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:05,415 INFO L82 PathProgramCache]: Analyzing trace with hash 662299287, now seen corresponding path program 2 times [2018-11-18 16:19:05,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:19:05,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:05,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:05,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:05,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:19:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:19:06,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:19:06,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:19:06,113 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:19:06,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:19:06,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:19:06,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:19:06,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:19:06,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 16:19:06,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 16:19:06,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:19:06,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:19:06,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:19:06,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:06,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:06,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 16:19:06,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:19:06,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:19:06,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 16:19:06,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:06,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:06,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-18 16:19:06,429 INFO L477 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 11 treesize of output 8 [2018-11-18 16:19:06,431 INFO L477 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 8 treesize of output 7 [2018-11-18 16:19:06,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:06,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:06,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:06,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-18 16:19:06,478 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-18 16:19:06,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 16:19:06,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:06,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:06,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:06,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-11-18 16:19:06,891 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-11-18 16:19:06,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-18 16:19:06,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:06,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:06,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:06,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-11-18 16:19:07,014 INFO L477 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 17 treesize of output 11 [2018-11-18 16:19:07,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-18 16:19:07,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:07,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:07,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:07,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:23 [2018-11-18 16:19:12,797 WARN L180 SmtUtils]: Spent 533.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-18 16:19:12,805 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:19:12,820 INFO L477 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 35 treesize of output 40 [2018-11-18 16:19:12,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 16:19:12,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:12,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:12,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:12,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:79, output treesize:66 [2018-11-18 16:19:13,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 110 [2018-11-18 16:19:13,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 64 [2018-11-18 16:19:13,272 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 16:19:13,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 80 [2018-11-18 16:19:13,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:13,568 INFO L477 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 78 treesize of output 74 [2018-11-18 16:19:13,569 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:13,714 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:19:13,718 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:19:13,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-11-18 16:19:13,719 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:13,875 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:19:13,876 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:19:13,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2018-11-18 16:19:13,878 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:14,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 92 treesize of output 82 [2018-11-18 16:19:14,054 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:14,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-11-18 16:19:14,209 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:14,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 82 treesize of output 74 [2018-11-18 16:19:14,368 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:14,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2018-11-18 16:19:14,520 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-18 16:19:14,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69 [2018-11-18 16:19:14,677 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:14,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 75 [2018-11-18 16:19:14,827 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:14,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 64 [2018-11-18 16:19:14,975 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:15,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 64 [2018-11-18 16:19:15,123 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:15,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 77 [2018-11-18 16:19:15,272 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:15,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2018-11-18 16:19:15,452 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:15,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-11-18 16:19:15,610 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:15,753 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:19:15,754 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:19:15,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2018-11-18 16:19:15,755 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:15,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 64 [2018-11-18 16:19:15,895 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:16,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2018-11-18 16:19:16,040 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 16:19:16,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 68 [2018-11-18 16:19:16,212 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 16:19:16,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2018-11-18 16:19:16,218 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 16:19:16,402 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:19:16,403 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:19:16,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2018-11-18 16:19:16,405 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:16,600 INFO L477 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 74 treesize of output 68 [2018-11-18 16:19:16,601 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:16,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-11-18 16:19:16,783 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:16,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 23 dim-1 vars, End of recursive call: 21 dim-0 vars, and 15 xjuncts. [2018-11-18 16:19:17,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-11-18 16:19:17,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 16:19:17,191 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-18 16:19:17,202 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,216 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-11-18 16:19:17,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-18 16:19:17,221 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 16:19:17,230 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,236 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-11-18 16:19:17,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-18 16:19:17,240 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 16:19:17,247 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,251 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-11-18 16:19:17,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 16:19:17,256 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-18 16:19:17,266 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,275 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-11-18 16:19:17,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 16:19:17,279 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-18 16:19:17,290 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,306 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-18 16:19:17,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 16:19:17,313 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,318 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-11-18 16:19:17,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-18 16:19:17,327 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 16:19:17,343 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,354 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 54 [2018-11-18 16:19:17,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-11-18 16:19:17,362 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2018-11-18 16:19:17,380 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-11-18 16:19:17,398 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,418 INFO L267 ElimStorePlain]: Start of recursive call 47: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 16:19:17,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-18 16:19:17,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 16:19:17,422 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,429 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-11-18 16:19:17,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-18 16:19:17,434 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 16:19:17,446 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,455 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-11-18 16:19:17,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-18 16:19:17,460 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 16:19:17,470 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,479 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-11-18 16:19:17,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-18 16:19:17,484 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 16:19:17,495 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,505 INFO L267 ElimStorePlain]: Start of recursive call 59: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 62 [2018-11-18 16:19:17,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-11-18 16:19:17,513 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-11-18 16:19:17,534 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2018-11-18 16:19:17,556 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,580 INFO L267 ElimStorePlain]: Start of recursive call 62: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 16:19:17,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-11-18 16:19:17,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 16:19:17,587 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-18 16:19:17,599 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,610 INFO L267 ElimStorePlain]: Start of recursive call 66: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-11-18 16:19:17,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 16:19:17,614 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-18 16:19:17,622 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,628 INFO L267 ElimStorePlain]: Start of recursive call 69: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:17,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 58 [2018-11-18 16:19:17,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2018-11-18 16:19:17,855 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:17,882 INFO L267 ElimStorePlain]: Start of recursive call 72: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:17,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-11-18 16:19:17,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 16:19:17,887 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:17,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 16:19:17,898 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:17,906 INFO L267 ElimStorePlain]: Start of recursive call 74: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:17,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-18 16:19:17,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 16:19:17,909 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:17,912 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:17,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 58 [2018-11-18 16:19:17,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-11-18 16:19:17,920 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:17,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2018-11-18 16:19:17,943 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:17,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2018-11-18 16:19:17,975 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:17,988 INFO L267 ElimStorePlain]: Start of recursive call 79: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:17,990 INFO L477 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 26 treesize of output 22 [2018-11-18 16:19:17,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 16:19:17,991 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:17,995 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:17,999 INFO L477 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 34 treesize of output 30 [2018-11-18 16:19:18,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 16:19:18,001 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,008 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-11-18 16:19:18,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 16:19:18,016 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 16:19:18,026 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,035 INFO L267 ElimStorePlain]: Start of recursive call 87: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-11-18 16:19:18,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 16:19:18,039 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 16:19:18,049 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,056 INFO L267 ElimStorePlain]: Start of recursive call 90: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 54 [2018-11-18 16:19:18,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-11-18 16:19:18,065 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2018-11-18 16:19:18,091 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2018-11-18 16:19:18,116 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,127 INFO L267 ElimStorePlain]: Start of recursive call 93: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-18 16:19:18,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 16:19:18,131 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 16:19:18,137 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,141 INFO L267 ElimStorePlain]: Start of recursive call 97: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-11-18 16:19:18,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 3 [2018-11-18 16:19:18,145 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,149 INFO L267 ElimStorePlain]: Start of recursive call 100: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-11-18 16:19:18,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 3 [2018-11-18 16:19:18,152 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,158 INFO L267 ElimStorePlain]: Start of recursive call 102: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-11-18 16:19:18,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 3 [2018-11-18 16:19:18,162 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,168 INFO L267 ElimStorePlain]: Start of recursive call 104: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-18 16:19:18,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 16:19:18,172 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 16:19:18,176 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,178 INFO L267 ElimStorePlain]: Start of recursive call 106: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-11-18 16:19:18,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 16:19:18,182 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,187 INFO L267 ElimStorePlain]: Start of recursive call 109: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-18 16:19:18,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 16:19:18,191 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 16:19:18,197 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,200 INFO L267 ElimStorePlain]: Start of recursive call 111: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-11-18 16:19:18,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 16:19:18,206 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 16:19:18,214 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,220 INFO L267 ElimStorePlain]: Start of recursive call 114: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:18,260 INFO L202 ElimStorePlain]: Needed 116 recursive calls to eliminate 7 variables, input treesize:93, output treesize:7 [2018-11-18 16:19:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 16:19:18,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:19:18,737 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 16:19:24,982 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 76 [2018-11-18 16:19:24,986 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 16:19:24,994 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 16:19:27,005 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_main_~s~0.offset_BEFORE_CALL_5 Int) (v_main_~len~0_BEFORE_CALL_6 Int) (v_prenex_39 Int) (v_prenex_40 Int)) (or (exists ((v_sll_circular_update_at_~data_8 Int) (v_sll_circular_update_at_~head.offset_12 Int)) (< (* 2 v_main_~len~0_BEFORE_CALL_6) (+ (select (select (store |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base|) (+ v_sll_circular_update_at_~head.offset_12 4) v_sll_circular_update_at_~data_8)) (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) v_main_~s~0.offset_BEFORE_CALL_5)) (+ (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) v_main_~s~0.offset_BEFORE_CALL_5) 4)) 1))) (exists ((v_prenex_32 Int) (v_prenex_31 Int)) (< (+ (select (select (store |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base|) (+ v_prenex_32 4) v_prenex_31)) (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) v_main_~s~0.offset_BEFORE_CALL_5)) (+ (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) v_main_~s~0.offset_BEFORE_CALL_5) 4)) 1) (* 2 v_main_~len~0_BEFORE_CALL_6))) (<= (* 2 v_main_~len~0_BEFORE_CALL_6) (+ (select (select (store |c_#memory_int| c_sll_circular_update_at_~head.base (store (select |c_#memory_int| c_sll_circular_update_at_~head.base) (+ v_prenex_39 4) v_prenex_40)) (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) v_main_~s~0.offset_BEFORE_CALL_5)) (+ (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) v_main_~s~0.offset_BEFORE_CALL_5) 4)) 1)))) (forall ((sll_circular_update_at_~head.offset Int) (v_prenex_34 Int) (v_prenex_33 Int) (sll_circular_update_at_~data Int)) (or (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (< (+ (select (select (store |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base|) (+ v_prenex_37 4) v_prenex_38)) (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) v_prenex_33)) (+ (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) v_prenex_33) 4)) 1) (* 2 v_prenex_34))) (<= (+ (select (select (store |c_#memory_int| c_sll_circular_update_at_~head.base (store (select |c_#memory_int| c_sll_circular_update_at_~head.base) (+ sll_circular_update_at_~head.offset 4) sll_circular_update_at_~data)) (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) v_prenex_33)) (+ (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) v_prenex_33) 4)) 1) (* 2 v_prenex_34)) (exists ((v_prenex_36 Int) (v_prenex_35 Int)) (< (* 2 v_prenex_34) (+ (select (select (store |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base|) (+ v_prenex_36 4) v_prenex_35)) (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) v_prenex_33)) (+ (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) v_prenex_33) 4)) 1)))))) is different from false [2018-11-18 16:19:27,014 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 16:19:27,018 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 16:19:27,024 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 16:19:57,541 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 87 [2018-11-18 16:19:57,576 INFO L477 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 0 case distinctions, treesize of input 75 treesize of output 51 [2018-11-18 16:19:57,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-11-18 16:19:57,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-11-18 16:19:57,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-18 16:19:57,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-11-18 16:19:57,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-18 16:19:57,614 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,615 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 16:19:57,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-18 16:19:57,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-18 16:19:57,643 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,646 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-11-18 16:19:57,648 INFO L477 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 [2018-11-18 16:19:57,648 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,649 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2018-11-18 16:19:57,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-11-18 16:19:57,661 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:57,663 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:19:57,671 INFO L477 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 0 case distinctions, treesize of input 63 treesize of output 43 [2018-11-18 16:19:57,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-18 16:19:57,683 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-18 16:19:57,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-18 16:19:57,698 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,701 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2018-11-18 16:19:57,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-18 16:19:57,704 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,706 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,714 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 16:19:57,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 16:19:57,729 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 8 variables, input treesize:151, output treesize:38 [2018-11-18 16:19:57,898 INFO L477 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 0 case distinctions, treesize of input 73 treesize of output 64 [2018-11-18 16:19:57,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-18 16:19:57,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2018-11-18 16:19:57,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-18 16:19:57,929 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-18 16:19:57,939 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:57,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2018-11-18 16:19:57,950 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-18 16:19:57,953 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 16:19:57,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 16:19:57,988 INFO L477 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 0 case distinctions, treesize of input 73 treesize of output 64 [2018-11-18 16:19:58,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-18 16:19:58,007 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:58,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2018-11-18 16:19:58,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-18 16:19:58,022 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:58,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-18 16:19:58,030 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:58,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2018-11-18 16:19:58,040 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-18 16:19:58,044 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 16:19:58,051 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 16:19:58,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-11-18 16:19:58,096 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:147, output treesize:183 [2018-11-18 16:19:58,330 INFO L477 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2018-11-18 16:19:58,332 INFO L477 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 32 treesize of output 30 [2018-11-18 16:19:58,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:58,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-11-18 16:19:58,359 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:58,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:19:58,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-11-18 16:19:58,406 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:125, output treesize:142 [2018-11-18 16:19:58,957 INFO L477 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 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-18 16:19:58,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-18 16:19:58,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:58,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 16:19:58,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 16:19:58,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:58,985 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:58,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-18 16:19:58,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-18 16:19:58,992 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 16:19:58,996 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:19:59,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:19:59,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:19:59,006 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:32, output treesize:9 [2018-11-18 16:19:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-11-18 16:19:59,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:19:59,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 29] total 81 [2018-11-18 16:19:59,461 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:19:59,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-18 16:19:59,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-18 16:19:59,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=6034, Unknown=23, NotChecked=156, Total=6480 [2018-11-18 16:19:59,463 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 57 states. [2018-11-18 16:20:11,835 WARN L180 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2018-11-18 16:20:29,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:20:29,007 INFO L93 Difference]: Finished difference Result 263 states and 302 transitions. [2018-11-18 16:20:29,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-18 16:20:29,009 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 69 [2018-11-18 16:20:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:20:29,012 INFO L225 Difference]: With dead ends: 263 [2018-11-18 16:20:29,012 INFO L226 Difference]: Without dead ends: 261 [2018-11-18 16:20:29,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 120 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2866 ImplicationChecksByTransitivity, 56.9s TimeCoverageRelationStatistics Valid=836, Invalid=13651, Unknown=37, NotChecked=238, Total=14762 [2018-11-18 16:20:29,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-18 16:20:29,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 143. [2018-11-18 16:20:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-18 16:20:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2018-11-18 16:20:29,046 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 69 [2018-11-18 16:20:29,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:20:29,047 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2018-11-18 16:20:29,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-18 16:20:29,047 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2018-11-18 16:20:29,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 16:20:29,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:20:29,048 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:20:29,049 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:20:29,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:20:29,049 INFO L82 PathProgramCache]: Analyzing trace with hash -94358883, now seen corresponding path program 3 times [2018-11-18 16:20:29,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:20:29,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:20:29,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:20:29,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:20:29,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:20:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:20:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 16:20:29,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:20:29,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:20:29,140 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:20:29,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:20:29,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:20:29,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:20:29,161 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 16:20:29,161 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 16:20:29,194 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 16:20:29,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:20:29,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:20:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 16:20:29,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:20:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 16:20:29,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:20:29,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 9 [2018-11-18 16:20:29,315 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:20:29,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 16:20:29,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 16:20:29,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:20:29,316 INFO L87 Difference]: Start difference. First operand 143 states and 162 transitions. Second operand 7 states. [2018-11-18 16:20:29,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:20:29,377 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2018-11-18 16:20:29,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:20:29,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-11-18 16:20:29,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:20:29,379 INFO L225 Difference]: With dead ends: 169 [2018-11-18 16:20:29,379 INFO L226 Difference]: Without dead ends: 140 [2018-11-18 16:20:29,380 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:20:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-18 16:20:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-11-18 16:20:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 16:20:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 156 transitions. [2018-11-18 16:20:29,399 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 156 transitions. Word has length 71 [2018-11-18 16:20:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:20:29,399 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 156 transitions. [2018-11-18 16:20:29,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 16:20:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 156 transitions. [2018-11-18 16:20:29,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 16:20:29,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:20:29,401 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:20:29,401 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:20:29,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:20:29,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1831091889, now seen corresponding path program 4 times [2018-11-18 16:20:29,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:20:29,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:20:29,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:20:29,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:20:29,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:20:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:20:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 16:20:29,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:20:29,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:20:29,467 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:20:29,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:20:29,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:20:29,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:20:29,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:20:29,482 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:20:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:20:29,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:20:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 16:20:29,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:20:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 16:20:29,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:20:29,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 8 [2018-11-18 16:20:29,678 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:20:29,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 16:20:29,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 16:20:29,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:20:29,678 INFO L87 Difference]: Start difference. First operand 140 states and 156 transitions. Second operand 7 states. [2018-11-18 16:20:29,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:20:29,837 INFO L93 Difference]: Finished difference Result 203 states and 226 transitions. [2018-11-18 16:20:29,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:20:29,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-11-18 16:20:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:20:29,839 INFO L225 Difference]: With dead ends: 203 [2018-11-18 16:20:29,839 INFO L226 Difference]: Without dead ends: 140 [2018-11-18 16:20:29,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 137 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:20:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-18 16:20:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 135. [2018-11-18 16:20:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-18 16:20:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2018-11-18 16:20:29,859 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 71 [2018-11-18 16:20:29,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:20:29,859 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2018-11-18 16:20:29,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 16:20:29,860 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2018-11-18 16:20:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 16:20:29,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:20:29,861 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:20:29,861 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:20:29,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:20:29,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1025141553, now seen corresponding path program 5 times [2018-11-18 16:20:29,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:20:29,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:20:29,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:20:29,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:20:29,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:20:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:20:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 16:20:29,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:20:29,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:20:29,917 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:20:29,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:20:29,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:20:29,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:20:29,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:20:29,925 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 16:20:29,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 16:20:29,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:20:29,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:20:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 16:20:30,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:20:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 16:20:30,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:20:30,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2018-11-18 16:20:30,093 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:20:30,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 16:20:30,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 16:20:30,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:20:30,093 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand 7 states. [2018-11-18 16:20:30,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:20:30,133 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2018-11-18 16:20:30,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:20:30,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-11-18 16:20:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:20:30,135 INFO L225 Difference]: With dead ends: 187 [2018-11-18 16:20:30,135 INFO L226 Difference]: Without dead ends: 123 [2018-11-18 16:20:30,135 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 138 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:20:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-18 16:20:30,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-11-18 16:20:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 16:20:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-11-18 16:20:30,150 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 71 [2018-11-18 16:20:30,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:20:30,150 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-11-18 16:20:30,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 16:20:30,151 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-11-18 16:20:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 16:20:30,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:20:30,152 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:20:30,152 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:20:30,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:20:30,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1969432934, now seen corresponding path program 6 times [2018-11-18 16:20:30,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:20:30,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:20:30,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:20:30,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:20:30,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:20:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:20:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 16:20:30,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:20:30,206 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:20:30,206 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:20:30,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:20:30,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:20:30,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:20:30,225 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 16:20:30,225 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 16:20:30,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 16:20:30,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:20:30,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:20:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 16:20:30,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:20:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 16:20:30,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:20:30,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 8 [2018-11-18 16:20:30,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:20:30,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:20:30,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:20:30,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:20:30,372 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 6 states. [2018-11-18 16:20:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:20:30,396 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-11-18 16:20:30,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:20:30,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-18 16:20:30,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:20:30,397 INFO L225 Difference]: With dead ends: 139 [2018-11-18 16:20:30,397 INFO L226 Difference]: Without dead ends: 79 [2018-11-18 16:20:30,398 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 152 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:20:30,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-18 16:20:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-18 16:20:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-18 16:20:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2018-11-18 16:20:30,408 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 78 [2018-11-18 16:20:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:20:30,408 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-11-18 16:20:30,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:20:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-11-18 16:20:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 16:20:30,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:20:30,409 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:20:30,409 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:20:30,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:20:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1222503635, now seen corresponding path program 1 times [2018-11-18 16:20:30,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:20:30,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:20:30,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:20:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:20:30,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:20:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:20:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 16:20:30,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:20:30,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:20:30,738 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2018-11-18 16:20:30,738 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [10], [14], [15], [16], [18], [22], [25], [27], [30], [34], [38], [43], [45], [48], [50], [52], [58], [61], [65], [69], [71], [75], [76], [81], [82], [83], [85], [89], [93], [95], [97], [101], [102], [128], [134], [136], [137], [138], [139], [140], [141], [142], [143], [146], [147], [148], [149], [150], [151], [152] [2018-11-18 16:20:30,739 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:20:30,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:20:30,799 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:20:30,799 INFO L272 AbstractInterpreter]: Visited 53 different actions 172 times. Merged at 29 different actions 60 times. Never widened. Performed 1086 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1086 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 15 fixpoints after 9 different actions. Largest state had 31 variables. [2018-11-18 16:20:30,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:20:30,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:20:30,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:20:30,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:20:30,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:20:30,836 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:20:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:20:30,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:20:30,968 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 16:20:30,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 16:20:30,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:20:30,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:20:30,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:20:30,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-18 16:20:31,318 INFO L477 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2018-11-18 16:20:31,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2018-11-18 16:20:31,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:20:31,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-18 16:20:31,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 16:20:31,366 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:20:31,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 25 [2018-11-18 16:20:31,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:20:31,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:20:31,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:20:31,381 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:76, output treesize:28 [2018-11-18 16:20:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 16:20:31,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:20:31,784 INFO L477 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 30 treesize of output 28 [2018-11-18 16:20:31,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-18 16:20:31,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:20:31,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:20:31,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-18 16:20:31,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-18 16:20:31,793 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:20:31,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:20:31,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-18 16:20:31,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-18 16:20:31,800 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 16:20:31,803 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:20:31,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-18 16:20:31,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-18 16:20:31,843 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 16:20:31,847 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:20:31,848 INFO L477 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 32 treesize of output 30 [2018-11-18 16:20:31,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-18 16:20:31,849 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 16:20:31,853 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:20:31,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-11-18 16:20:31,883 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:77, output treesize:121 [2018-11-18 16:20:32,095 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 16:20:32,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:20:32,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 15] total 47 [2018-11-18 16:20:32,111 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:20:32,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-18 16:20:32,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-18 16:20:32,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2012, Unknown=0, NotChecked=0, Total=2162 [2018-11-18 16:20:32,112 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 36 states. [2018-11-18 16:20:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:20:33,005 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-11-18 16:20:33,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 16:20:33,006 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2018-11-18 16:20:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:20:33,006 INFO L225 Difference]: With dead ends: 96 [2018-11-18 16:20:33,007 INFO L226 Difference]: Without dead ends: 94 [2018-11-18 16:20:33,008 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=401, Invalid=3505, Unknown=0, NotChecked=0, Total=3906 [2018-11-18 16:20:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-18 16:20:33,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2018-11-18 16:20:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-18 16:20:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-11-18 16:20:33,018 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 81 [2018-11-18 16:20:33,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:20:33,019 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-11-18 16:20:33,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-18 16:20:33,019 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-18 16:20:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 16:20:33,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:20:33,020 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:20:33,020 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:20:33,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:20:33,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1391107545, now seen corresponding path program 2 times [2018-11-18 16:20:33,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:20:33,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:20:33,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:20:33,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:20:33,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:20:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:20:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 16:20:33,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:20:33,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:20:33,064 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:20:33,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:20:33,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:20:33,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:20:33,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:20:33,073 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 16:20:33,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 16:20:33,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:20:33,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:20:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 16:20:33,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:20:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 16:20:33,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:20:33,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 8 [2018-11-18 16:20:33,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:20:33,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 16:20:33,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 16:20:33,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:20:33,163 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 7 states. [2018-11-18 16:20:33,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:20:33,207 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-11-18 16:20:33,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:20:33,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-11-18 16:20:33,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:20:33,208 INFO L225 Difference]: With dead ends: 102 [2018-11-18 16:20:33,208 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 16:20:33,208 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 161 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:20:33,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 16:20:33,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 16:20:33,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 16:20:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 16:20:33,209 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2018-11-18 16:20:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:20:33,209 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:20:33,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 16:20:33,209 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:20:33,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 16:20:33,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 16:20:33,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:20:33,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:20:33,552 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-11-18 16:20:33,752 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2018-11-18 16:20:33,994 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-11-18 16:20:34,108 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 78 [2018-11-18 16:20:34,266 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 60 [2018-11-18 16:20:34,407 INFO L425 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-11-18 16:20:34,408 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 560 562) no Hoare annotation was computed. [2018-11-18 16:20:34,408 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 560 562) the Hoare annotation is: true [2018-11-18 16:20:34,408 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 560 562) no Hoare annotation was computed. [2018-11-18 16:20:34,408 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 16:20:34,408 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-18 16:20:34,408 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:20:34,408 INFO L425 ceAbstractionStarter]: For program point sll_circular_get_data_atEXIT(lines 595 601) no Hoare annotation was computed. [2018-11-18 16:20:34,408 INFO L428 ceAbstractionStarter]: At program point sll_circular_get_data_atENTRY(lines 595 601) the Hoare annotation is: true [2018-11-18 16:20:34,408 INFO L425 ceAbstractionStarter]: For program point L596-1(lines 596 599) no Hoare annotation was computed. [2018-11-18 16:20:34,409 INFO L421 ceAbstractionStarter]: At program point L596-3(lines 596 599) the Hoare annotation is: (let ((.cse2 (forall ((v_main_~s~0.offset_BEFORE_CALL_7 Int) (v_main_~len~0_BEFORE_CALL_23 Int) (v_main_~s~0.base_BEFORE_CALL_7 Int)) (let ((.cse6 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_7) (+ v_main_~s~0.offset_BEFORE_CALL_7 4)))) (or (< 2 v_main_~len~0_BEFORE_CALL_23) (< (* 2 v_main_~len~0_BEFORE_CALL_23) (+ .cse6 2)) (<= (+ .cse6 1) v_main_~len~0_BEFORE_CALL_23))))) (.cse0 (not (= |#NULL.base| 0))) (.cse1 (not (= |#NULL.offset| 0)))) (and (or .cse0 (not (= |sll_circular_get_data_at_#in~index| 1)) (= sll_circular_get_data_at_~index 1) .cse1 .cse2 (and (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base)) (forall ((v_main_~s~0.base_BEFORE_CALL_3 Int) (sll_circular_create_~last~0.offset Int)) (let ((.cse3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) 0))) (or (= .cse3 v_main_~s~0.base_BEFORE_CALL_3) (not (= (select (select |#memory_int| .cse3) (+ (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) 0) 4)) 3)) (not (= (select (select |#memory_$Pointer$.base| .cse3) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_3)))))) (let ((.cse4 (<= sll_circular_get_data_at_~index 0)) (.cse5 (<= 1 |sll_circular_get_data_at_#in~index|))) (or (and .cse4 .cse5) .cse2 (or .cse0 .cse1) (and (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (< sll_circular_get_data_at_~index 2) (or .cse4 .cse5)) (<= 2 |sll_circular_get_data_at_#in~index|))))) [2018-11-18 16:20:34,409 INFO L425 ceAbstractionStarter]: For program point L596-4(lines 596 599) no Hoare annotation was computed. [2018-11-18 16:20:34,409 INFO L425 ceAbstractionStarter]: For program point sll_circular_get_data_atFINAL(lines 595 601) no Hoare annotation was computed. [2018-11-18 16:20:34,409 INFO L421 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (or (not (= |#NULL.base| 0)) (and (< sll_circular_create_~len 3) (= sll_circular_create_~data 1) (= 0 sll_circular_create_~head~0.offset) (= sll_circular_create_~last~0.base sll_circular_create_~head~0.base) (= (select |#valid| sll_circular_create_~last~0.base) 1)) (not (= |#NULL.offset| 0)) (not (= |sll_circular_create_#in~len| 2)) (not (= |sll_circular_create_#in~data| 1))) [2018-11-18 16:20:34,409 INFO L425 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-11-18 16:20:34,409 INFO L425 ceAbstractionStarter]: For program point L575-1(lines 575 580) no Hoare annotation was computed. [2018-11-18 16:20:34,409 INFO L421 ceAbstractionStarter]: At program point L573(line 573) the Hoare annotation is: (or (and (= sll_circular_create_~data 1) (= |#valid| |old(#valid)|) (= sll_circular_create_~len 2) (= |#memory_int| |old(#memory_int)|)) (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0)) (not (= |sll_circular_create_#in~len| 2)) (not (= |sll_circular_create_#in~data| 1))) [2018-11-18 16:20:34,409 INFO L425 ceAbstractionStarter]: For program point L573-1(line 573) no Hoare annotation was computed. [2018-11-18 16:20:34,409 INFO L421 ceAbstractionStarter]: At program point L575-3(lines 575 580) the Hoare annotation is: (let ((.cse0 (= sll_circular_create_~data 1))) (or (and (= 0 sll_circular_create_~head~0.offset) (= sll_circular_create_~last~0.base sll_circular_create_~head~0.base) (= (select |#valid| sll_circular_create_~last~0.base) 1) .cse0 (= sll_circular_create_~len 2)) (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0)) (not (= |sll_circular_create_#in~len| 2)) (not (= |sll_circular_create_#in~data| 1)) (and (= sll_circular_create_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| sll_circular_create_~last~0.base (store (select |#memory_$Pointer$.offset| sll_circular_create_~last~0.base) sll_circular_create_~last~0.offset sll_circular_create_~head~0.offset)) sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) .cse0 (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) 0) sll_circular_create_~last~0.base) (<= sll_circular_create_~len 1) (not (= sll_circular_create_~head~0.base (select (select (store |#memory_$Pointer$.base| sll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| sll_circular_create_~last~0.base) sll_circular_create_~last~0.offset sll_circular_create_~head~0.base)) sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)))))) [2018-11-18 16:20:34,409 INFO L425 ceAbstractionStarter]: For program point L575-4(lines 575 580) no Hoare annotation was computed. [2018-11-18 16:20:34,410 INFO L421 ceAbstractionStarter]: At program point sll_circular_createENTRY(lines 572 583) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0)) (not (= |sll_circular_create_#in~len| 2)) (not (= |sll_circular_create_#in~data| 1))) [2018-11-18 16:20:34,410 INFO L425 ceAbstractionStarter]: For program point sll_circular_createFINAL(lines 572 583) no Hoare annotation was computed. [2018-11-18 16:20:34,410 INFO L425 ceAbstractionStarter]: For program point sll_circular_createEXIT(lines 572 583) no Hoare annotation was computed. [2018-11-18 16:20:34,410 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:20:34,410 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= |#NULL.base| 0) (= |#NULL.offset| 0)) [2018-11-18 16:20:34,410 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 16:20:34,410 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 16:20:34,410 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 609 628) no Hoare annotation was computed. [2018-11-18 16:20:34,410 INFO L425 ceAbstractionStarter]: For program point L624(line 624) no Hoare annotation was computed. [2018-11-18 16:20:34,410 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 609 628) no Hoare annotation was computed. [2018-11-18 16:20:34,411 INFO L421 ceAbstractionStarter]: At program point L620(line 620) the Hoare annotation is: (let ((.cse1 (< main_~len~0 (+ main_~new_data~0 1))) (.cse0 (= main_~data~0 1)) (.cse4 (+ main_~new_data~0 2)) (.cse5 (* 2 main_~len~0))) (or (not (= |#NULL.base| 0)) (and (= 0 main_~s~0.offset) .cse0 (<= main_~i~0 0) .cse1 (exists ((main_~len~0 Int)) (let ((.cse2 (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 4))) (.cse3 (* 2 main_~len~0))) (and (< main_~len~0 (+ .cse2 1)) (<= main_~len~0 2) (< main_~len~0 (+ main_~expected~0 1)) (<= (+ .cse2 2) .cse3) (<= (+ main_~expected~0 2) .cse3)))) (= main_~len~0 2) (<= .cse4 (+ main_~i~0 .cse5))) (let ((.cse7 (select |#memory_int| main_~s~0.base)) (.cse6 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (and (= 0 .cse6) .cse1 (exists ((sll_circular_create_~last~0.offset Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) 0)) sll_circular_create_~last~0.offset) main_~s~0.base)) (<= (+ (select .cse7 (+ main_~s~0.offset 4)) 2) .cse5) (= 3 main_~expected~0) (= main_~i~0 1) (= main_~s~0.offset 0) .cse0 (<= main_~len~0 2) (<= (+ main_~i~0 main_~len~0) (+ (select .cse7 (+ 0 4)) 1)) (<= .cse4 .cse5) (= .cse5 (+ (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (+ .cse6 4)) 1)))) (not (= |#NULL.offset| 0)))) [2018-11-18 16:20:34,411 INFO L425 ceAbstractionStarter]: For program point L620-1(line 620) no Hoare annotation was computed. [2018-11-18 16:20:34,411 INFO L425 ceAbstractionStarter]: For program point L620-2(lines 620 622) no Hoare annotation was computed. [2018-11-18 16:20:34,411 INFO L425 ceAbstractionStarter]: For program point L618-1(lines 618 623) no Hoare annotation was computed. [2018-11-18 16:20:34,411 INFO L421 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse8 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (let ((.cse0 (= 0 .cse8)) (.cse1 (= main_~s~0.offset 0)) (.cse2 (= main_~data~0 1)) (.cse3 (not (= (select .cse7 0) main_~s~0.base))) (.cse4 (exists ((sll_circular_create_~last~0.offset Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) 0)) sll_circular_create_~last~0.offset) main_~s~0.base))) (.cse5 (= main_~len~0 2))) (or (not (= |#NULL.base| 0)) (and .cse0 .cse1 .cse2 .cse3 (= main_~new_data~0 3) .cse4 (= (+ main_~i~0 1) main_~len~0) .cse5) (not (= |#NULL.offset| 0)) (let ((.cse6 (* 2 main_~len~0))) (and .cse0 .cse1 (<= main_~i~0 0) .cse2 (< main_~len~0 (+ main_~new_data~0 1)) .cse3 .cse4 .cse5 (<= (+ main_~new_data~0 2) (+ main_~i~0 .cse6)) (= .cse6 (+ (select (select |#memory_int| (select .cse7 main_~s~0.offset)) (+ .cse8 4)) 1))))))) [2018-11-18 16:20:34,411 INFO L425 ceAbstractionStarter]: For program point L616-1(lines 614 617) no Hoare annotation was computed. [2018-11-18 16:20:34,411 INFO L425 ceAbstractionStarter]: For program point L618-3(lines 618 623) no Hoare annotation was computed. [2018-11-18 16:20:34,411 INFO L421 ceAbstractionStarter]: At program point L618-4(lines 618 623) the Hoare annotation is: (let ((.cse13 (select |#memory_int| main_~s~0.base))) (let ((.cse12 (+ main_~new_data~0 2)) (.cse6 (* 2 main_~len~0)) (.cse11 (select .cse13 (+ 0 4)))) (let ((.cse3 (+ .cse11 1)) (.cse4 (<= .cse12 .cse6)) (.cse1 (= main_~data~0 1)) (.cse2 (< main_~len~0 (+ main_~new_data~0 1))) (.cse5 (<= (+ (select .cse13 (+ main_~s~0.offset 4)) 2) .cse6))) (or (not (= |#NULL.base| 0)) (let ((.cse0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (and (= 0 .cse0) (= main_~s~0.offset 0) .cse1 .cse2 (exists ((sll_circular_create_~last~0.offset Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) 0)) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (+ main_~i~0 1) main_~len~0) (<= (+ main_~i~0 main_~len~0) .cse3) .cse4 (= main_~len~0 2) .cse5 (= .cse6 (+ (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (+ .cse0 4)) 1)))) (not (= |#NULL.offset| 0)) (and (let ((.cse7 (= 0 main_~s~0.offset)) (.cse8 (+ main_~i~0 .cse6))) (or (and .cse7 (<= .cse3 .cse8) .cse1 .cse2 (exists ((main_~len~0 Int)) (let ((.cse9 (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 4))) (.cse10 (* 2 main_~len~0))) (and (< main_~len~0 (+ .cse9 1)) (<= main_~len~0 2) (< main_~len~0 (+ main_~expected~0 1)) (<= (+ .cse9 2) .cse10) (<= (+ main_~expected~0 2) .cse10)))) .cse4) (and .cse7 .cse1 .cse2 (<= .cse6 (+ .cse11 2)) .cse5 (<= .cse12 .cse8)))) (<= main_~len~0 2) (<= main_~i~0 0)))))) [2018-11-18 16:20:34,412 INFO L425 ceAbstractionStarter]: For program point L614-1(lines 614 617) no Hoare annotation was computed. [2018-11-18 16:20:34,412 INFO L428 ceAbstractionStarter]: At program point L618-5(lines 618 623) the Hoare annotation is: true [2018-11-18 16:20:34,412 INFO L421 ceAbstractionStarter]: At program point L612(line 612) the Hoare annotation is: (or (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0)) (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= main_~data~0 1) (= main_~len~0 2))) [2018-11-18 16:20:34,412 INFO L425 ceAbstractionStarter]: For program point L612-1(line 612) no Hoare annotation was computed. [2018-11-18 16:20:34,412 INFO L421 ceAbstractionStarter]: At program point L614-3(lines 614 617) the Hoare annotation is: (let ((.cse2 (* 2 main_~len~0)) (.cse12 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse13 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (let ((.cse3 (+ main_~new_data~0 1)) (.cse6 (<= main_~i~0 1)) (.cse9 (= .cse2 (+ (select (select |#memory_int| (select .cse12 main_~s~0.offset)) (+ .cse13 4)) 1))) (.cse0 (= 0 .cse13)) (.cse1 (= main_~s~0.offset 0)) (.cse4 (= main_~data~0 1)) (.cse5 (not (= (select .cse12 0) main_~s~0.base))) (.cse7 (exists ((sll_circular_create_~last~0.offset Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) 0)) sll_circular_create_~last~0.offset) main_~s~0.base))) (.cse8 (= main_~len~0 2))) (or (and (<= 0 main_~i~0) .cse0 .cse1 (<= .cse2 .cse3) .cse4 .cse5 .cse6 (<= .cse3 .cse2) .cse7 .cse8 .cse9) (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0)) (let ((.cse10 (select (select |#memory_int| main_~s~0.base) (+ 0 4)))) (let ((.cse11 (+ .cse10 2))) (and .cse0 (<= (+ .cse10 1) (+ main_~i~0 .cse2)) .cse1 .cse4 (< main_~len~0 .cse3) (<= .cse11 .cse2) .cse6 (<= .cse2 .cse11) .cse7 (<= (+ main_~new_data~0 2) .cse2) .cse8 .cse9))) (and .cse0 .cse1 .cse4 .cse5 .cse7 (= (+ main_~i~0 1) main_~len~0) .cse8)))) [2018-11-18 16:20:34,412 INFO L425 ceAbstractionStarter]: For program point L614-4(lines 614 617) no Hoare annotation was computed. [2018-11-18 16:20:34,412 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 609 628) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0))) [2018-11-18 16:20:34,412 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 626) no Hoare annotation was computed. [2018-11-18 16:20:34,413 INFO L421 ceAbstractionStarter]: At program point L621(lines 609 628) the Hoare annotation is: (or (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0))) [2018-11-18 16:20:34,413 INFO L428 ceAbstractionStarter]: At program point sll_circular_destroyENTRY(lines 584 594) the Hoare annotation is: true [2018-11-18 16:20:34,413 INFO L425 ceAbstractionStarter]: For program point sll_circular_destroyEXIT(lines 584 594) no Hoare annotation was computed. [2018-11-18 16:20:34,413 INFO L425 ceAbstractionStarter]: For program point L587-1(lines 587 591) no Hoare annotation was computed. [2018-11-18 16:20:34,413 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 593) no Hoare annotation was computed. [2018-11-18 16:20:34,413 INFO L428 ceAbstractionStarter]: At program point L587-3(lines 587 591) the Hoare annotation is: true [2018-11-18 16:20:34,413 INFO L425 ceAbstractionStarter]: For program point L587-4(lines 587 591) no Hoare annotation was computed. [2018-11-18 16:20:34,413 INFO L425 ceAbstractionStarter]: For program point L585-2(lines 584 594) no Hoare annotation was computed. [2018-11-18 16:20:34,413 INFO L425 ceAbstractionStarter]: For program point sll_circular_update_atEXIT(lines 602 608) no Hoare annotation was computed. [2018-11-18 16:20:34,413 INFO L421 ceAbstractionStarter]: At program point sll_circular_update_atENTRY(lines 602 608) the Hoare annotation is: (or (= |#memory_int| |old(#memory_int)|) (or (forall ((v_main_~s~0.base_BEFORE_CALL_2 Int) (sll_circular_create_~last~0.offset Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) 0))) (or (not (= (select (select |#memory_$Pointer$.base| .cse0) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_2)) (= .cse0 v_main_~s~0.base_BEFORE_CALL_2)))) (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0)))) [2018-11-18 16:20:34,413 INFO L425 ceAbstractionStarter]: For program point sll_circular_update_atFINAL(lines 602 608) no Hoare annotation was computed. [2018-11-18 16:20:34,413 INFO L425 ceAbstractionStarter]: For program point L603-1(lines 603 606) no Hoare annotation was computed. [2018-11-18 16:20:34,414 INFO L421 ceAbstractionStarter]: At program point L603-3(lines 603 606) the Hoare annotation is: (let ((.cse4 (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base)) (.cse5 (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data)) (.cse3 (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|)) (.cse0 (forall ((v_main_~s~0.base_BEFORE_CALL_2 Int) (sll_circular_create_~last~0.offset Int)) (let ((.cse7 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) 0))) (or (not (= (select (select |#memory_$Pointer$.base| .cse7) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_2)) (= .cse7 v_main_~s~0.base_BEFORE_CALL_2))))) (.cse1 (not (= |#NULL.base| 0))) (.cse2 (not (= |#NULL.offset| 0)))) (and (or .cse0 (not (= |sll_circular_update_at_#in~data| 3)) .cse1 (not (= |sll_circular_update_at_#in~index| 1)) .cse2 (and .cse3 .cse4 .cse5 (= sll_circular_update_at_~index 1)) (and (= sll_circular_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (<= (+ sll_circular_update_at_~index 1) |sll_circular_update_at_#in~index|) .cse5 (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))) (let ((.cse6 (= |#memory_int| |old(#memory_int)|))) (or (and .cse6 (<= 1 |sll_circular_update_at_#in~index|)) (and (<= sll_circular_update_at_~index |sll_circular_update_at_#in~index|) (and .cse4 .cse5 .cse6) .cse3) (or .cse0 .cse1 .cse2))))) [2018-11-18 16:20:34,414 INFO L425 ceAbstractionStarter]: For program point L603-4(lines 603 606) no Hoare annotation was computed. [2018-11-18 16:20:34,414 INFO L421 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (or (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0)) (not (= |node_create_#in~data| 1)) (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|))) [2018-11-18 16:20:34,414 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-11-18 16:20:34,414 INFO L428 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-11-18 16:20:34,414 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-11-18 16:20:34,414 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-11-18 16:20:34,414 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-11-18 16:20:34,418 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,419 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,419 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,420 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,420 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,422 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,422 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,422 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,422 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,423 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,423 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,423 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,426 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,426 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,426 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,426 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,426 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,427 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,427 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,427 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,427 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,428 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,428 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,428 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,430 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,430 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,431 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,431 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,431 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,431 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,431 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,432 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,432 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,432 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,432 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,432 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,433 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,433 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,433 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,433 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,433 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,434 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,434 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,434 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,435 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,435 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,435 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,435 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,435 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,435 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,436 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,436 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,436 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,436 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,436 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,436 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,437 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,437 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,437 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,437 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,437 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,437 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,438 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,438 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,438 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,439 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,439 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,439 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,439 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,440 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,440 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,440 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,440 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,440 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,441 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,441 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,441 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,441 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,441 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,441 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,442 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,442 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,442 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,442 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,443 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,443 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,443 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,443 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,443 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,443 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,444 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,444 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,444 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,444 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,444 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,444 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,445 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,445 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,445 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,445 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,445 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,445 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,445 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,446 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,446 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,446 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,447 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,447 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,449 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,449 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,449 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,450 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,450 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,450 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,451 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,452 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,452 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,452 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,452 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,452 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,453 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,453 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,453 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,453 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,453 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,453 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,454 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,454 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,454 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,454 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,454 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,454 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,455 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,455 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,455 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,456 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,456 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,456 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,456 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,456 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,456 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,457 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,457 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,457 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,457 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,457 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,457 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,458 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,458 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,458 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,458 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,458 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,458 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,458 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,459 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,459 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,459 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,459 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,459 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,459 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,460 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,460 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,460 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,463 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,464 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,464 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,464 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,464 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,465 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,465 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,465 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,465 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,465 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,466 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,466 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,466 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,466 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,466 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,467 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,467 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,467 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,467 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,467 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,470 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,470 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,470 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,470 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,471 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,471 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,471 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,471 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,471 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,471 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,472 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,472 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,472 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,472 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,473 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,473 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,473 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,473 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,473 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,473 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,474 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,474 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,474 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,474 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,476 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,476 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,476 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,476 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,476 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,476 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,477 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,478 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,478 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,478 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,478 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,478 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,479 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,479 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,479 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,479 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,479 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,480 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,480 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,480 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,480 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,480 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,482 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,482 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,482 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,482 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,483 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,484 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:20:34 BoogieIcfgContainer [2018-11-18 16:20:34,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:20:34,490 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:20:34,490 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:20:34,490 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:20:34,491 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:19:01" (3/4) ... [2018-11-18 16:20:34,493 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 16:20:34,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-11-18 16:20:34,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 16:20:34,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_get_data_at [2018-11-18 16:20:34,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_create [2018-11-18 16:20:34,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 16:20:34,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_destroy [2018-11-18 16:20:34,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_update_at [2018-11-18 16:20:34,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-18 16:20:34,501 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2018-11-18 16:20:34,502 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-18 16:20:34,502 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 16:20:34,521 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((0 <= i && 0 == #memory_$Pointer$[s][s]) && s == 0) && 2 * len <= new_data + 1) && data == 1) && !(#memory_$Pointer$[s][0] == s)) && i <= 1) && new_data + 1 <= 2 * len) && (\exists sll_circular_create_~last~0.offset : int :: #memory_$Pointer$[#memory_$Pointer$[s][0]][sll_circular_create_~last~0.offset] == s)) && len == 2) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] + 1) || !(#NULL == 0)) || !(#NULL == 0)) || (((((((((((0 == #memory_$Pointer$[s][s] && unknown-#memory_int-unknown[s][0 + 4] + 1 <= i + 2 * len) && s == 0) && data == 1) && len < new_data + 1) && unknown-#memory_int-unknown[s][0 + 4] + 2 <= 2 * len) && i <= 1) && 2 * len <= unknown-#memory_int-unknown[s][0 + 4] + 2) && (\exists sll_circular_create_~last~0.offset : int :: #memory_$Pointer$[#memory_$Pointer$[s][0]][sll_circular_create_~last~0.offset] == s)) && new_data + 2 <= 2 * len) && len == 2) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] + 1)) || ((((((0 == #memory_$Pointer$[s][s] && s == 0) && data == 1) && !(#memory_$Pointer$[s][0] == s)) && (\exists sll_circular_create_~last~0.offset : int :: #memory_$Pointer$[#memory_$Pointer$[s][0]][sll_circular_create_~last~0.offset] == s)) && i + 1 == len) && len == 2) [2018-11-18 16:20:34,521 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == head && last == head) && \valid[last] == 1) && data == 1) && len == 2) || !(#NULL == 0)) || !(#NULL == 0)) || !(\old(len) == 2)) || !(\old(data) == 1)) || (((((head == 0 && 0 == #memory_$Pointer$[last := #memory_$Pointer$[last][last := head]][head][head]) && data == 1) && #memory_$Pointer$[head][0] == last) && len <= 1) && !(head == #memory_$Pointer$[last := #memory_$Pointer$[last][last := head]][head][head])) [2018-11-18 16:20:34,521 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(#NULL == 0) || ((((((((((0 == #memory_$Pointer$[s][s] && s == 0) && data == 1) && len < new_data + 1) && (\exists sll_circular_create_~last~0.offset : int :: #memory_$Pointer$[#memory_$Pointer$[s][0]][sll_circular_create_~last~0.offset] == s)) && i + 1 == len) && i + len <= unknown-#memory_int-unknown[s][0 + 4] + 1) && new_data + 2 <= 2 * len) && len == 2) && unknown-#memory_int-unknown[s][s + 4] + 2 <= 2 * len) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] + 1)) || !(#NULL == 0)) || ((((((((0 == s && unknown-#memory_int-unknown[s][0 + 4] + 1 <= i + 2 * len) && data == 1) && len < new_data + 1) && (\exists main_~len~0 : int :: (((main_~len~0 < unknown-#memory_int-unknown[s][s + 4] + 1 && main_~len~0 <= 2) && main_~len~0 < expected + 1) && unknown-#memory_int-unknown[s][s + 4] + 2 <= 2 * main_~len~0) && expected + 2 <= 2 * main_~len~0)) && new_data + 2 <= 2 * len) || (((((0 == s && data == 1) && len < new_data + 1) && 2 * len <= unknown-#memory_int-unknown[s][0 + 4] + 2) && unknown-#memory_int-unknown[s][s + 4] + 2 <= 2 * len) && new_data + 2 <= i + 2 * len)) && len <= 2) && i <= 0) [2018-11-18 16:20:34,521 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((forall v_main_~s~0.base_BEFORE_CALL_2 : int, sll_circular_create_~last~0.offset : int :: !(#memory_$Pointer$[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][0]][sll_circular_create_~last~0.offset] == v_main_~s~0.base_BEFORE_CALL_2) || #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][0] == v_main_~s~0.base_BEFORE_CALL_2) || !(\old(data) == 3)) || !(#NULL == 0)) || !(\old(index) == 1)) || !(#NULL == 0)) || (((head == head && head == head) && \old(data) == data) && index == 1)) || (((head == #memory_$Pointer$[head][head] && index + 1 <= \old(index)) && \old(data) == data) && #memory_$Pointer$[head][head] == head)) && (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && 1 <= \old(index)) || ((index <= \old(index) && (head == head && \old(data) == data) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && head == head)) || ((forall v_main_~s~0.base_BEFORE_CALL_2 : int, sll_circular_create_~last~0.offset : int :: !(#memory_$Pointer$[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][0]][sll_circular_create_~last~0.offset] == v_main_~s~0.base_BEFORE_CALL_2) || #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][0] == v_main_~s~0.base_BEFORE_CALL_2) || !(#NULL == 0)) || !(#NULL == 0)) [2018-11-18 16:20:34,522 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(#NULL == 0) || !(\old(index) == 1)) || index == 1) || !(#NULL == 0)) || (forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~len~0_BEFORE_CALL_23 : int, v_main_~s~0.base_BEFORE_CALL_7 : int :: (2 < v_main_~len~0_BEFORE_CALL_23 || 2 * v_main_~len~0_BEFORE_CALL_23 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4] + 2) || unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4] + 1 <= v_main_~len~0_BEFORE_CALL_23)) || (head == #memory_$Pointer$[head][head] && #memory_$Pointer$[head][head] == head)) || (forall v_main_~s~0.base_BEFORE_CALL_3 : int, sll_circular_create_~last~0.offset : int :: (#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0] == v_main_~s~0.base_BEFORE_CALL_3 || !(unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0] + 4] == 3)) || !(#memory_$Pointer$[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0]][sll_circular_create_~last~0.offset] == v_main_~s~0.base_BEFORE_CALL_3))) && (((((index <= 0 && 1 <= \old(index)) || (forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~len~0_BEFORE_CALL_23 : int, v_main_~s~0.base_BEFORE_CALL_7 : int :: (2 < v_main_~len~0_BEFORE_CALL_23 || 2 * v_main_~len~0_BEFORE_CALL_23 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4] + 2) || unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4] + 1 <= v_main_~len~0_BEFORE_CALL_23)) || !(#NULL == 0) || !(#NULL == 0)) || (((head == head && head == head) && index < 2) && (index <= 0 || 1 <= \old(index)))) || 2 <= \old(index)) [2018-11-18 16:20:34,533 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_74638691-5575-435b-a7b6-82c2bf2f0c10/bin-2019/utaipan/witness.graphml [2018-11-18 16:20:34,533 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:20:34,534 INFO L168 Benchmark]: Toolchain (without parser) took 94168.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.6 MB). Free memory was 956.6 MB in the beginning and 1.0 GB in the end (delta: -50.6 MB). Peak memory consumption was 211.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:20:34,534 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:20:34,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:20:34,535 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:20:34,535 INFO L168 Benchmark]: Boogie Preprocessor took 30.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:20:34,535 INFO L168 Benchmark]: RCFGBuilder took 316.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-11-18 16:20:34,535 INFO L168 Benchmark]: TraceAbstraction took 93379.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.3 MB). Peak memory consumption was 389.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:20:34,535 INFO L168 Benchmark]: Witness Printer took 43.72 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:20:34,536 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 368.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 316.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 93379.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.3 MB). Peak memory consumption was 389.0 MB. Max. memory is 11.5 GB. * Witness Printer took 43.72 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,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$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,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_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,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$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,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_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,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_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,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_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,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_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,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_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,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$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,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$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 626]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 575]: Loop Invariant [2018-11-18 16:20:34,557 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,557 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,558 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,558 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,558 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,558 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,558 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,558 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,559 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,559 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,559 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,559 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,559 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,559 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,560 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,567 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,568 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,568 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,568 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,568 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,568 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,568 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,568 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,568 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((0 == head && last == head) && \valid[last] == 1) && data == 1) && len == 2) || !(#NULL == 0)) || !(#NULL == 0)) || !(\old(len) == 2)) || !(\old(data) == 1)) || (((((head == 0 && 0 == #memory_$Pointer$[last := #memory_$Pointer$[last][last := head]][head][head]) && data == 1) && #memory_$Pointer$[head][0] == last) && len <= 1) && !(head == #memory_$Pointer$[last := #memory_$Pointer$[last][last := head]][head][head])) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 614]: Loop Invariant [2018-11-18 16:20:34,568 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,569 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,569 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,569 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,569 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,569 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,569 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,569 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,570 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,570 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,570 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,577 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,577 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,577 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,577 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,577 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,577 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,577 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,578 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,578 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,578 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,578 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,578 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,578 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,578 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,578 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,578 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,578 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,578 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,580 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,580 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,580 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,581 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,581 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,581 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,581 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,581 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,581 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,581 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,581 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,581 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,582 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,582 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,582 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,582 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,582 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,582 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,583 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,583 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,583 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,583 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,583 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,583 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,586 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,586 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,586 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,586 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,587 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,587 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,587 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,587 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,587 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,587 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,587 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,587 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,588 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,588 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,588 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,588 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((((0 <= i && 0 == #memory_$Pointer$[s][s]) && s == 0) && 2 * len <= new_data + 1) && data == 1) && !(#memory_$Pointer$[s][0] == s)) && i <= 1) && new_data + 1 <= 2 * len) && (\exists sll_circular_create_~last~0.offset : int :: #memory_$Pointer$[#memory_$Pointer$[s][0]][sll_circular_create_~last~0.offset] == s)) && len == 2) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] + 1) || !(#NULL == 0)) || !(#NULL == 0)) || (((((((((((0 == #memory_$Pointer$[s][s] && unknown-#memory_int-unknown[s][0 + 4] + 1 <= i + 2 * len) && s == 0) && data == 1) && len < new_data + 1) && unknown-#memory_int-unknown[s][0 + 4] + 2 <= 2 * len) && i <= 1) && 2 * len <= unknown-#memory_int-unknown[s][0 + 4] + 2) && (\exists sll_circular_create_~last~0.offset : int :: #memory_$Pointer$[#memory_$Pointer$[s][0]][sll_circular_create_~last~0.offset] == s)) && new_data + 2 <= 2 * len) && len == 2) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] + 1)) || ((((((0 == #memory_$Pointer$[s][s] && s == 0) && data == 1) && !(#memory_$Pointer$[s][0] == s)) && (\exists sll_circular_create_~last~0.offset : int :: #memory_$Pointer$[#memory_$Pointer$[s][0]][sll_circular_create_~last~0.offset] == s)) && i + 1 == len) && len == 2) - InvariantResult [Line: 609]: Loop Invariant [2018-11-18 16:20:34,588 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,589 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,589 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,589 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: !(#NULL == 0) || !(#NULL == 0) - InvariantResult [Line: 596]: Loop Invariant [2018-11-18 16:20:34,589 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,589 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,589 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,605 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,605 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,605 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,605 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,605 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,605 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,605 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,606 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,606 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,606 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,606 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,606 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,606 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,606 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,606 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,606 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,606 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,606 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,606 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,606 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,625 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,625 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,625 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,625 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,625 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,625 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,626 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,626 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,626 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,626 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,626 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,626 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,626 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,626 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,627 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,627 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,627 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,627 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,627 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,627 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,627 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,628 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,628 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,628 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,628 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,628 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,628 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,628 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,629 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,643 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,643 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,643 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,643 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,643 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,643 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,643 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,643 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,643 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,643 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,643 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,643 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,644 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-18 16:20:34,644 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,644 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,644 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,644 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,644 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,644 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 16:20:34,644 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_23,QUANTIFIED] [2018-11-18 16:20:34,657 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,658 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,658 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,658 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,658 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,658 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,658 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,658 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,658 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((((!(#NULL == 0) || !(\old(index) == 1)) || index == 1) || !(#NULL == 0)) || (forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~len~0_BEFORE_CALL_23 : int, v_main_~s~0.base_BEFORE_CALL_7 : int :: (2 < v_main_~len~0_BEFORE_CALL_23 || 2 * v_main_~len~0_BEFORE_CALL_23 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4] + 2) || unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4] + 1 <= v_main_~len~0_BEFORE_CALL_23)) || (head == #memory_$Pointer$[head][head] && #memory_$Pointer$[head][head] == head)) || (forall v_main_~s~0.base_BEFORE_CALL_3 : int, sll_circular_create_~last~0.offset : int :: (#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0] == v_main_~s~0.base_BEFORE_CALL_3 || !(unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0] + 4] == 3)) || !(#memory_$Pointer$[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0]][sll_circular_create_~last~0.offset] == v_main_~s~0.base_BEFORE_CALL_3))) && (((((index <= 0 && 1 <= \old(index)) || (forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~len~0_BEFORE_CALL_23 : int, v_main_~s~0.base_BEFORE_CALL_7 : int :: (2 < v_main_~len~0_BEFORE_CALL_23 || 2 * v_main_~len~0_BEFORE_CALL_23 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4] + 2) || unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4] + 1 <= v_main_~len~0_BEFORE_CALL_23)) || !(#NULL == 0) || !(#NULL == 0)) || (((head == head && head == head) && index < 2) && (index <= 0 || 1 <= \old(index)))) || 2 <= \old(index)) - InvariantResult [Line: 603]: Loop Invariant [2018-11-18 16:20:34,660 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,660 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,660 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,673 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,673 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,673 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,674 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,674 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,674 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,674 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,674 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,674 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,675 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,675 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,675 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,675 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,675 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,675 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,675 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,675 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,676 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,676 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,676 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,676 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,676 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,676 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,676 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,676 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,690 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,690 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,690 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,690 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,691 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,691 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,691 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,691 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,691 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,692 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,692 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,692 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,692 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,692 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,692 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,692 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,693 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,693 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,693 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,693 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,693 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,693 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,693 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,694 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 16:20:34,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,709 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,709 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,709 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,709 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,709 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,709 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,709 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,709 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,709 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,710 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,710 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: (((((((forall v_main_~s~0.base_BEFORE_CALL_2 : int, sll_circular_create_~last~0.offset : int :: !(#memory_$Pointer$[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][0]][sll_circular_create_~last~0.offset] == v_main_~s~0.base_BEFORE_CALL_2) || #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][0] == v_main_~s~0.base_BEFORE_CALL_2) || !(\old(data) == 3)) || !(#NULL == 0)) || !(\old(index) == 1)) || !(#NULL == 0)) || (((head == head && head == head) && \old(data) == data) && index == 1)) || (((head == #memory_$Pointer$[head][head] && index + 1 <= \old(index)) && \old(data) == data) && #memory_$Pointer$[head][head] == head)) && (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && 1 <= \old(index)) || ((index <= \old(index) && (head == head && \old(data) == data) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && head == head)) || ((forall v_main_~s~0.base_BEFORE_CALL_2 : int, sll_circular_create_~last~0.offset : int :: !(#memory_$Pointer$[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][0]][sll_circular_create_~last~0.offset] == v_main_~s~0.base_BEFORE_CALL_2) || #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][0] == v_main_~s~0.base_BEFORE_CALL_2) || !(#NULL == 0)) || !(#NULL == 0)) - InvariantResult [Line: 618]: Loop Invariant [2018-11-18 16:20:34,710 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,710 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,710 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,711 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,711 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,725 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,726 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,726 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,726 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,726 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,726 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,726 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,727 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,727 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,727 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,727 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,727 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,727 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,727 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,727 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,728 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,728 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,728 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,728 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,728 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,728 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,729 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,729 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,729 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,729 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-11-18 16:20:34,729 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 16:20:34,729 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 16:20:34,729 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,759 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,759 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,759 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,759 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-18 16:20:34,760 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,760 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,760 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,760 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,760 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,760 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,761 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,761 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,761 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 16:20:34,761 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 16:20:34,761 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,761 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,761 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,761 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:20:34,761 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((!(#NULL == 0) || ((((((((((0 == #memory_$Pointer$[s][s] && s == 0) && data == 1) && len < new_data + 1) && (\exists sll_circular_create_~last~0.offset : int :: #memory_$Pointer$[#memory_$Pointer$[s][0]][sll_circular_create_~last~0.offset] == s)) && i + 1 == len) && i + len <= unknown-#memory_int-unknown[s][0 + 4] + 1) && new_data + 2 <= 2 * len) && len == 2) && unknown-#memory_int-unknown[s][s + 4] + 2 <= 2 * len) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] + 1)) || !(#NULL == 0)) || ((((((((0 == s && unknown-#memory_int-unknown[s][0 + 4] + 1 <= i + 2 * len) && data == 1) && len < new_data + 1) && (\exists main_~len~0 : int :: (((main_~len~0 < unknown-#memory_int-unknown[s][s + 4] + 1 && main_~len~0 <= 2) && main_~len~0 < expected + 1) && unknown-#memory_int-unknown[s][s + 4] + 2 <= 2 * main_~len~0) && expected + 2 <= 2 * main_~len~0)) && new_data + 2 <= 2 * len) || (((((0 == s && data == 1) && len < new_data + 1) && 2 * len <= unknown-#memory_int-unknown[s][0 + 4] + 2) && unknown-#memory_int-unknown[s][s + 4] + 2 <= 2 * len) && new_data + 2 <= i + 2 * len)) && len <= 2) && i <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 66 locations, 1 error locations. SAFE Result, 93.2s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 33.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 632 SDtfs, 953 SDslu, 3288 SDs, 0 SdLazy, 4082 SolverSat, 445 SolverUnsat, 46 SolverUnknown, 0 SolverNotchecked, 21.3s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1453 GetRequests, 1142 SyntacticMatches, 35 SemanticMatches, 276 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3900 ImplicationChecksByTransitivity, 59.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.8413095238095235 AbsIntWeakeningRatio, 1.1727272727272726 AbsIntAvgWeakeningVarsNumRemoved, 3.0272727272727273 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 173 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 82 PreInvPairs, 113 NumberOfFragments, 1359 HoareAnnotationTreeSize, 82 FomulaSimplifications, 6778 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 24 FomulaSimplificationsInter, 2551 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 56.5s InterpolantComputationTime, 1393 NumberOfCodeBlocks, 1377 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1947 ConstructedInterpolants, 82 QuantifiedInterpolants, 813669 SizeOfPredicates, 65 NumberOfNonLiveVariables, 2284 ConjunctsInSsa, 172 ConjunctsInUnsatCore, 29 InterpolantComputations, 7 PerfectInterpolantSequences, 653/820 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...