./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_73b4cfdc-4510-42b8-9f6a-7725974adc5a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_73b4cfdc-4510-42b8-9f6a-7725974adc5a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_73b4cfdc-4510-42b8-9f6a-7725974adc5a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_73b4cfdc-4510-42b8-9f6a-7725974adc5a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_73b4cfdc-4510-42b8-9f6a-7725974adc5a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_73b4cfdc-4510-42b8-9f6a-7725974adc5a/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c911d3bfcad41488f605dca082dbd47805d189ae ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:35:14,901 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:35:14,902 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:35:14,910 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:35:14,910 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:35:14,911 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:35:14,911 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:35:14,912 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:35:14,914 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:35:14,914 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:35:14,915 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:35:14,915 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:35:14,916 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:35:14,917 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:35:14,918 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:35:14,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:35:14,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:35:14,920 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:35:14,921 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:35:14,923 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:35:14,923 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:35:14,924 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:35:14,926 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:35:14,926 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:35:14,927 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:35:14,927 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:35:14,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:35:14,929 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:35:14,929 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:35:14,930 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:35:14,930 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:35:14,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:35:14,931 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:35:14,931 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:35:14,932 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:35:14,932 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:35:14,933 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_73b4cfdc-4510-42b8-9f6a-7725974adc5a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 05:35:14,943 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:35:14,944 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:35:14,945 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:35:14,945 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:35:14,945 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:35:14,945 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:35:14,945 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:35:14,946 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:35:14,946 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:35:14,946 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:35:14,946 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:35:14,946 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:35:14,946 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:35:14,946 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:35:14,947 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:35:14,947 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:35:14,947 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:35:14,947 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:35:14,947 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:35:14,947 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:35:14,947 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:35:14,948 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:35:14,948 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:35:14,948 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:35:14,948 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:35:14,948 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:35:14,948 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:35:14,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:35:14,949 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:35:14,949 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:35:14,949 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:35:14,949 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_73b4cfdc-4510-42b8-9f6a-7725974adc5a/bin-2019/uautomizer 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(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> c911d3bfcad41488f605dca082dbd47805d189ae [2018-11-10 05:35:14,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:35:14,981 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:35:14,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:35:14,984 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:35:14,984 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:35:14,984 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_73b4cfdc-4510-42b8-9f6a-7725974adc5a/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-10 05:35:15,021 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73b4cfdc-4510-42b8-9f6a-7725974adc5a/bin-2019/uautomizer/data/9bf6b0145/244c22b96fbe477d84084582b28f30db/FLAG942a7545d [2018-11-10 05:35:15,383 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:35:15,383 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_73b4cfdc-4510-42b8-9f6a-7725974adc5a/sv-benchmarks/c/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-10 05:35:15,392 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73b4cfdc-4510-42b8-9f6a-7725974adc5a/bin-2019/uautomizer/data/9bf6b0145/244c22b96fbe477d84084582b28f30db/FLAG942a7545d [2018-11-10 05:35:15,401 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_73b4cfdc-4510-42b8-9f6a-7725974adc5a/bin-2019/uautomizer/data/9bf6b0145/244c22b96fbe477d84084582b28f30db [2018-11-10 05:35:15,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:35:15,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:35:15,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:35:15,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:35:15,407 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:35:15,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:35:15" (1/1) ... [2018-11-10 05:35:15,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d834faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:15, skipping insertion in model container [2018-11-10 05:35:15,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:35:15" (1/1) ... [2018-11-10 05:35:15,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:35:15,447 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:35:15,633 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:35:15,641 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:35:15,666 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:35:15,698 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:35:15,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:15 WrapperNode [2018-11-10 05:35:15,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:35:15,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:35:15,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:35:15,699 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:35:15,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:15" (1/1) ... [2018-11-10 05:35:15,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:15" (1/1) ... [2018-11-10 05:35:15,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:35:15,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:35:15,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:35:15,765 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:35:15,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:15" (1/1) ... [2018-11-10 05:35:15,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:15" (1/1) ... [2018-11-10 05:35:15,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:15" (1/1) ... [2018-11-10 05:35:15,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:15" (1/1) ... [2018-11-10 05:35:15,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:15" (1/1) ... [2018-11-10 05:35:15,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:15" (1/1) ... [2018-11-10 05:35:15,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:15" (1/1) ... [2018-11-10 05:35:15,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:35:15,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:35:15,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:35:15,783 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:35:15,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73b4cfdc-4510-42b8-9f6a-7725974adc5a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:35:15,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 05:35:15,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 05:35:15,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:35:15,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:35:15,953 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:35:15,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:35:15 BoogieIcfgContainer [2018-11-10 05:35:15,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:35:15,954 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:35:15,954 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:35:15,958 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:35:15,959 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:35:15,959 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:35:15" (1/3) ... [2018-11-10 05:35:15,960 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ee363ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:35:15, skipping insertion in model container [2018-11-10 05:35:15,961 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:35:15,961 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:15" (2/3) ... [2018-11-10 05:35:15,961 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ee363ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:35:15, skipping insertion in model container [2018-11-10 05:35:15,961 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:35:15,961 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:35:15" (3/3) ... [2018-11-10 05:35:15,963 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-10 05:35:16,000 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:35:16,000 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:35:16,001 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:35:16,001 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:35:16,001 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:35:16,001 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:35:16,001 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:35:16,001 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:35:16,001 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:35:16,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 05:35:16,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 05:35:16,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:35:16,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:35:16,032 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:35:16,032 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:35:16,032 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:35:16,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 05:35:16,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 05:35:16,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:35:16,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:35:16,034 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:35:16,034 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:35:16,041 INFO L793 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 15#L553true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 19#L553-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 20#L543-3true [2018-11-10 05:35:16,041 INFO L795 eck$LassoCheckResult]: Loop: 20#L543-3true assume true; 16#L543-1true assume !!(insertionSort_~i~0 < insertionSort_~array_size); 8#L545true SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L545 11#L545-1true insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 25#L546-8true assume !true; 4#L546-9true SUMMARY for call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~j~0 * 4, 4); srcloc: L546-9 3#L548true insertionSort_#t~pre2 := insertionSort_~i~0 + 1;insertionSort_~i~0 := insertionSort_~i~0 + 1;havoc insertionSort_#t~pre2; 20#L543-3true [2018-11-10 05:35:16,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:16,045 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-10 05:35:16,046 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:16,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:16,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:16,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:16,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:16,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:16,124 INFO L82 PathProgramCache]: Analyzing trace with hash 928967495, now seen corresponding path program 1 times [2018-11-10 05:35:16,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:16,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:16,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:16,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:16,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:16,144 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-10 05:35:16,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:35:16,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:35:16,148 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:35:16,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 05:35:16,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 05:35:16,159 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-10 05:35:16,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:35:16,164 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-10 05:35:16,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 05:35:16,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-11-10 05:35:16,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 05:35:16,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 22 transitions. [2018-11-10 05:35:16,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 05:35:16,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 05:35:16,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-10 05:35:16,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:35:16,170 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 05:35:16,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-10 05:35:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 05:35:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 05:35:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-10 05:35:16,195 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 05:35:16,196 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 05:35:16,196 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:35:16,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-10 05:35:16,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 05:35:16,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:35:16,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:35:16,197 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:35:16,197 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:35:16,198 INFO L793 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 68#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 69#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 70#L553-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 55#L543-3 [2018-11-10 05:35:16,198 INFO L795 eck$LassoCheckResult]: Loop: 55#L543-3 assume true; 71#L543-1 assume !!(insertionSort_~i~0 < insertionSort_~array_size); 60#L545 SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L545 61#L545-1 insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 66#L546-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 62#L546-1 assume !insertionSort_#t~short6; 64#L546-5 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 56#L546-9 SUMMARY for call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~j~0 * 4, 4); srcloc: L546-9 54#L548 insertionSort_#t~pre2 := insertionSort_~i~0 + 1;insertionSort_~i~0 := insertionSort_~i~0 + 1;havoc insertionSort_#t~pre2; 55#L543-3 [2018-11-10 05:35:16,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:16,198 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-10 05:35:16,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:16,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:16,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:16,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:16,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:16,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:16,216 INFO L82 PathProgramCache]: Analyzing trace with hash -634363177, now seen corresponding path program 1 times [2018-11-10 05:35:16,216 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:16,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:16,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:16,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:35:16,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:16,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:16,238 INFO L82 PathProgramCache]: Analyzing trace with hash 2147345267, now seen corresponding path program 1 times [2018-11-10 05:35:16,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:16,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:16,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:16,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:16,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:16,316 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-10 05:35:16,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:35:16,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:35:16,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:35:16,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:35:16,432 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-10 05:35:16,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:35:16,537 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-10 05:35:16,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:35:16,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 55 transitions. [2018-11-10 05:35:16,540 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2018-11-10 05:35:16,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 55 transitions. [2018-11-10 05:35:16,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-10 05:35:16,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-11-10 05:35:16,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 55 transitions. [2018-11-10 05:35:16,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:35:16,541 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-11-10 05:35:16,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 55 transitions. [2018-11-10 05:35:16,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 25. [2018-11-10 05:35:16,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 05:35:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-10 05:35:16,543 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-10 05:35:16,543 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-10 05:35:16,543 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:35:16,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2018-11-10 05:35:16,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 05:35:16,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:35:16,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:35:16,547 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:35:16,547 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:35:16,547 INFO L793 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 153#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 154#L553-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 157#L543-3 assume true; 162#L543-1 assume !!(insertionSort_~i~0 < insertionSort_~array_size); 161#L545 SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L545 160#L545-1 insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 159#L546-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 147#L546-1 assume insertionSort_#t~short6; 148#L546-2 [2018-11-10 05:35:16,547 INFO L795 eck$LassoCheckResult]: Loop: 148#L546-2 SUMMARY for call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + (insertionSort_~j~0 - 1) * 4, 4); srcloc: L546-2 150#L546-3 insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 151#L546-5 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 141#L547 SUMMARY for call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + (insertionSort_~j~0 - 1) * 4, 4); srcloc: L547 142#L547-1 SUMMARY for call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~j~0 * 4, 4); srcloc: L547-1 143#L547-2 havoc insertionSort_#t~mem7; 144#L546-7 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 149#L546-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 158#L546-1 assume insertionSort_#t~short6; 148#L546-2 [2018-11-10 05:35:16,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:16,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2015135634, now seen corresponding path program 1 times [2018-11-10 05:35:16,548 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:16,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:16,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:16,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:16,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:16,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:16,573 INFO L82 PathProgramCache]: Analyzing trace with hash -660683095, now seen corresponding path program 1 times [2018-11-10 05:35:16,573 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:16,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:16,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:16,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:16,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:16,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:16,585 INFO L82 PathProgramCache]: Analyzing trace with hash -261654308, now seen corresponding path program 1 times [2018-11-10 05:35:16,585 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:16,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:16,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:16,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:16,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:35:16,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:35:16,676 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73b4cfdc-4510-42b8-9f6a-7725974adc5a/bin-2019/uautomizer/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-10 05:35:16,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:16,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:35:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:35:16,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:35:16,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-10 05:35:16,901 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-11-10 05:35:16,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:35:16,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:35:16,935 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-11-10 05:35:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:35:17,082 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-10 05:35:17,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:35:17,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 52 transitions. [2018-11-10 05:35:17,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 05:35:17,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 52 transitions. [2018-11-10 05:35:17,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-10 05:35:17,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-10 05:35:17,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 52 transitions. [2018-11-10 05:35:17,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:35:17,087 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-10 05:35:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 52 transitions. [2018-11-10 05:35:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2018-11-10 05:35:17,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 05:35:17,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-10 05:35:17,091 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-10 05:35:17,091 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-10 05:35:17,092 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:35:17,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 39 transitions. [2018-11-10 05:35:17,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 05:35:17,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:35:17,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:35:17,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:35:17,093 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:35:17,094 INFO L793 eck$LassoCheckResult]: Stem: 307#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 303#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 304#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 305#L553-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 308#L543-3 assume true; 318#L543-1 assume !!(insertionSort_~i~0 < insertionSort_~array_size); 317#L545 SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L545 297#L545-1 insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 298#L546-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 312#L546-1 assume insertionSort_#t~short6; 313#L546-2 SUMMARY for call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + (insertionSort_~j~0 - 1) * 4, 4); srcloc: L546-2 301#L546-3 insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 302#L546-5 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 286#L546-9 [2018-11-10 05:35:17,094 INFO L795 eck$LassoCheckResult]: Loop: 286#L546-9 SUMMARY for call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~j~0 * 4, 4); srcloc: L546-9 284#L548 insertionSort_#t~pre2 := insertionSort_~i~0 + 1;insertionSort_~i~0 := insertionSort_~i~0 + 1;havoc insertionSort_#t~pre2; 285#L543-3 assume true; 306#L543-1 assume !!(insertionSort_~i~0 < insertionSort_~array_size); 293#L545 SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L545 294#L545-1 insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 314#L546-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 315#L546-1 assume !insertionSort_#t~short6; 292#L546-5 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 286#L546-9 [2018-11-10 05:35:17,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:17,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2147218836, now seen corresponding path program 1 times [2018-11-10 05:35:17,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:17,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:17,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:17,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:17,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:17,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:17,121 INFO L82 PathProgramCache]: Analyzing trace with hash -498385261, now seen corresponding path program 2 times [2018-11-10 05:35:17,122 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:17,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:17,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:17,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:17,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:17,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:17,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1138827680, now seen corresponding path program 1 times [2018-11-10 05:35:17,134 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:17,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:17,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:17,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:35:17,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:35:17,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:35:17,191 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73b4cfdc-4510-42b8-9f6a-7725974adc5a/bin-2019/uautomizer/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-10 05:35:17,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:17,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:35:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:35:17,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:35:17,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2018-11-10 05:35:17,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 05:35:17,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 05:35:17,324 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-10 05:35:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:35:17,503 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-11-10 05:35:17,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:35:17,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 69 transitions. [2018-11-10 05:35:17,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2018-11-10 05:35:17,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 69 transitions. [2018-11-10 05:35:17,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-10 05:35:17,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2018-11-10 05:35:17,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 69 transitions. [2018-11-10 05:35:17,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:35:17,506 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-11-10 05:35:17,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 69 transitions. [2018-11-10 05:35:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2018-11-10 05:35:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 05:35:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-11-10 05:35:17,510 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-10 05:35:17,510 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-10 05:35:17,510 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:35:17,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 51 transitions. [2018-11-10 05:35:17,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-10 05:35:17,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:35:17,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:35:17,513 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:35:17,513 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:35:17,513 INFO L793 eck$LassoCheckResult]: Stem: 500#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 496#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 497#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 498#L553-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 502#L543-3 assume true; 522#L543-1 assume !!(insertionSort_~i~0 < insertionSort_~array_size); 521#L545 SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L545 490#L545-1 insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 491#L546-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 505#L546-1 assume insertionSort_#t~short6; 492#L546-2 SUMMARY for call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + (insertionSort_~j~0 - 1) * 4, 4); srcloc: L546-2 493#L546-3 insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 506#L546-5 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 479#L546-9 [2018-11-10 05:35:17,513 INFO L795 eck$LassoCheckResult]: Loop: 479#L546-9 SUMMARY for call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~j~0 * 4, 4); srcloc: L546-9 477#L548 insertionSort_#t~pre2 := insertionSort_~i~0 + 1;insertionSort_~i~0 := insertionSort_~i~0 + 1;havoc insertionSort_#t~pre2; 478#L543-3 assume true; 499#L543-1 assume !!(insertionSort_~i~0 < insertionSort_~array_size); 484#L545 SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L545 485#L545-1 insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 520#L546-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 519#L546-1 assume insertionSort_#t~short6; 518#L546-2 SUMMARY for call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + (insertionSort_~j~0 - 1) * 4, 4); srcloc: L546-2 517#L546-3 insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 516#L546-5 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 479#L546-9 [2018-11-10 05:35:17,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:17,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2147218836, now seen corresponding path program 2 times [2018-11-10 05:35:17,514 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:17,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:17,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:17,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:17,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:17,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:17,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2087976374, now seen corresponding path program 1 times [2018-11-10 05:35:17,535 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:17,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:17,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:17,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:35:17,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:17,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:17,549 INFO L82 PathProgramCache]: Analyzing trace with hash 803135043, now seen corresponding path program 1 times [2018-11-10 05:35:17,549 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:17,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:17,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:17,823 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2018-11-10 05:35:17,874 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:35:17,875 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:35:17,875 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:35:17,875 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:35:17,875 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:35:17,875 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:35:17,875 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:35:17,875 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:35:17,875 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-10 05:35:17,875 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:35:17,876 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:35:17,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:17,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:17,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:17,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:17,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:17,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:17,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:18,035 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2018-11-10 05:35:18,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:18,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:18,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:18,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:18,373 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:35:18,376 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:35:18,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:18,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:18,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:35:18,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:18,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:18,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:18,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:35:18,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:35:18,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:18,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:18,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:18,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:35:18,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:18,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:18,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:18,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:35:18,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:35:18,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:18,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:18,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:18,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:35:18,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:18,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:18,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:18,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:35:18,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:35:18,387 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:18,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:18,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:18,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:35:18,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:18,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:18,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:18,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:35:18,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:35:18,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:18,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:18,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:18,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:18,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:18,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:18,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:35:18,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:35:18,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:18,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:18,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:18,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:18,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:18,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:18,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:35:18,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:35:18,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:18,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:18,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:18,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:18,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:18,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:18,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:35:18,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:35:18,401 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:18,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:18,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:18,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:18,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:18,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:18,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:35:18,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:35:18,409 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:18,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:18,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:18,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:18,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:18,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:18,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:35:18,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:35:18,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:18,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:18,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:18,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:18,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:18,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:18,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:35:18,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:35:18,459 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:35:18,502 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-10 05:35:18,502 INFO L444 ModelExtractionUtils]: 31 out of 43 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-10 05:35:18,504 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:35:18,505 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:35:18,505 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:35:18,505 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_insertionSort_~i~0, v_rep(select #length ULTIMATE.start_insertionSort_~a.base)_1) = -1*ULTIMATE.start_insertionSort_~a.offset - 4*ULTIMATE.start_insertionSort_~i~0 + 1*v_rep(select #length ULTIMATE.start_insertionSort_~a.base)_1 Supporting invariants [] [2018-11-10 05:35:18,537 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-10 05:35:18,542 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:35:18,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:18,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:35:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:18,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:35:18,617 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-10 05:35:18,619 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 05:35:18,620 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 51 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-10 05:35:18,677 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 51 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 75 states and 84 transitions. Complement of second has 6 states. [2018-11-10 05:35:18,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:35:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:35:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-10 05:35:18,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 13 letters. Loop has 11 letters. [2018-11-10 05:35:18,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:35:18,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 24 letters. Loop has 11 letters. [2018-11-10 05:35:18,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:35:18,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 13 letters. Loop has 22 letters. [2018-11-10 05:35:18,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:35:18,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 84 transitions. [2018-11-10 05:35:18,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 05:35:18,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 74 transitions. [2018-11-10 05:35:18,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-10 05:35:18,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-10 05:35:18,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 74 transitions. [2018-11-10 05:35:18,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:35:18,686 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-11-10 05:35:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 74 transitions. [2018-11-10 05:35:18,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-11-10 05:35:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 05:35:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-11-10 05:35:18,691 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-11-10 05:35:18,691 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-11-10 05:35:18,691 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 05:35:18,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 63 transitions. [2018-11-10 05:35:18,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 05:35:18,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:35:18,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:35:18,694 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:35:18,694 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:35:18,694 INFO L793 eck$LassoCheckResult]: Stem: 754#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 749#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 750#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 751#L553-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 756#L543-3 assume true; 752#L543-1 assume !!(insertionSort_~i~0 < insertionSort_~array_size); 736#L545 SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L545 737#L545-1 insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 740#L546-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 765#L546-1 assume insertionSort_#t~short6; 763#L546-2 SUMMARY for call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + (insertionSort_~j~0 - 1) * 4, 4); srcloc: L546-2 760#L546-3 insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 761#L546-5 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 720#L546-9 SUMMARY for call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~j~0 * 4, 4); srcloc: L546-9 718#L548 insertionSort_#t~pre2 := insertionSort_~i~0 + 1;insertionSort_~i~0 := insertionSort_~i~0 + 1;havoc insertionSort_#t~pre2; 719#L543-3 assume true; 753#L543-1 assume !!(insertionSort_~i~0 < insertionSort_~array_size); 738#L545 SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L545 739#L545-1 insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 742#L546-8 [2018-11-10 05:35:18,695 INFO L795 eck$LassoCheckResult]: Loop: 742#L546-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 729#L546-1 assume insertionSort_#t~short6; 730#L546-2 SUMMARY for call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + (insertionSort_~j~0 - 1) * 4, 4); srcloc: L546-2 743#L546-3 insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 746#L546-5 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 722#L547 SUMMARY for call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + (insertionSort_~j~0 - 1) * 4, 4); srcloc: L547 723#L547-1 SUMMARY for call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~j~0 * 4, 4); srcloc: L547-1 726#L547-2 havoc insertionSort_#t~mem7; 733#L546-7 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 742#L546-8 [2018-11-10 05:35:18,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:18,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1800144356, now seen corresponding path program 2 times [2018-11-10 05:35:18,695 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:18,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:18,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:18,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:18,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:18,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:18,712 INFO L82 PathProgramCache]: Analyzing trace with hash -868623101, now seen corresponding path program 2 times [2018-11-10 05:35:18,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:18,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:18,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:18,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:35:18,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:18,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:18,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1293816136, now seen corresponding path program 1 times [2018-11-10 05:35:18,721 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:35:18,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:35:18,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:18,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:35:18,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:35:19,024 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 102 [2018-11-10 05:35:19,076 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:35:19,076 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:35:19,076 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:35:19,076 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:35:19,076 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:35:19,076 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:35:19,076 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:35:19,076 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:35:19,076 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-10 05:35:19,076 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:35:19,076 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:35:19,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:19,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:19,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:19,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:19,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:19,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:19,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:19,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:19,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:19,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:19,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:35:19,501 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:35:19,501 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:35:19,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:19,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:19,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:35:19,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:19,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:19,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:19,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:35:19,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:35:19,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:19,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:19,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:19,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:35:19,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:19,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:19,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:19,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:35:19,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:35:19,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:19,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:19,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:19,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:35:19,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:19,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:19,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:19,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:35:19,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:35:19,509 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:19,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:19,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:19,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:19,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:19,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:19,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:35:19,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:35:19,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:19,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:19,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:19,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:35:19,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:19,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:19,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:19,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:35:19,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:35:19,514 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:19,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:19,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:19,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:35:19,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:19,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:19,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:19,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:35:19,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:35:19,517 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:19,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:19,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:19,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:35:19,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:19,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:19,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:19,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:35:19,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:35:19,519 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:19,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:19,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:19,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:19,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:19,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:19,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:35:19,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:35:19,522 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:19,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:19,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:19,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:35:19,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:19,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:19,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:19,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:35:19,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:35:19,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:19,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:19,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:19,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:19,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:19,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:19,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:35:19,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:35:19,531 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:35:19,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:35:19,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:35:19,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:35:19,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:35:19,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:35:19,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:35:19,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:35:19,569 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:35:19,582 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 05:35:19,582 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 05:35:19,583 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:35:19,584 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:35:19,585 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:35:19,585 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2018-11-10 05:35:19,610 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-10 05:35:19,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:19,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:35:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:19,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:35:19,659 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-10 05:35:19,659 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 05:35:19,659 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 63 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 05:35:19,712 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 63 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 90 states and 98 transitions. Complement of second has 11 states. [2018-11-10 05:35:19,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 05:35:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:35:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-10 05:35:19,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 19 letters. Loop has 9 letters. [2018-11-10 05:35:19,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:35:19,714 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:35:19,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:19,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:35:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:19,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:35:19,766 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-10 05:35:19,766 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 05:35:19,766 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 63 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 05:35:19,803 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 63 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 90 states and 98 transitions. Complement of second has 11 states. [2018-11-10 05:35:19,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 05:35:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:35:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-10 05:35:19,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 19 letters. Loop has 9 letters. [2018-11-10 05:35:19,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:35:19,806 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:35:19,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:19,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:35:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:19,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:35:19,850 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-10 05:35:19,850 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 05:35:19,850 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 63 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 05:35:19,891 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 63 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 125 states and 135 transitions. Complement of second has 10 states. [2018-11-10 05:35:19,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 05:35:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:35:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-10 05:35:19,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 19 letters. Loop has 9 letters. [2018-11-10 05:35:19,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:35:19,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 28 letters. Loop has 9 letters. [2018-11-10 05:35:19,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:35:19,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 19 letters. Loop has 18 letters. [2018-11-10 05:35:19,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:35:19,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 135 transitions. [2018-11-10 05:35:19,896 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:35:19,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 0 states and 0 transitions. [2018-11-10 05:35:19,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:35:19,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:35:19,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:35:19,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:35:19,897 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:35:19,897 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:35:19,897 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:35:19,897 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 05:35:19,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:35:19,897 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:35:19,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:35:19,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:35:19 BoogieIcfgContainer [2018-11-10 05:35:19,905 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:35:19,905 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:35:19,905 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:35:19,906 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:35:19,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:35:15" (3/4) ... [2018-11-10 05:35:19,910 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:35:19,910 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:35:19,911 INFO L168 Benchmark]: Toolchain (without parser) took 4507.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.9 MB). Free memory was 956.5 MB in the beginning and 1.2 GB in the end (delta: -279.5 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:35:19,911 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:35:19,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.12 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 935.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:35:19,912 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -208.7 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 05:35:19,913 INFO L168 Benchmark]: Boogie Preprocessor took 17.79 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:35:19,913 INFO L168 Benchmark]: RCFGBuilder took 170.93 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: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:35:19,913 INFO L168 Benchmark]: BuchiAutomizer took 3950.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.1 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:35:19,914 INFO L168 Benchmark]: Witness Printer took 5.03 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:35:19,920 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.12 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 935.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -208.7 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.79 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 170.93 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: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3950.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.1 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.03 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 1 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * a + -4 * i + unknown-#length-unknown[a] and consists of 4 locations. One nondeterministic module has affine ranking function j and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 66 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 57 states and ocurred in iteration 5. Nontrivial modules had stage [1, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 174 SDtfs, 341 SDslu, 218 SDs, 0 SdLazy, 319 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital204 mio100 ax100 hnf99 lsp97 ukn84 mio100 lsp57 div100 bol100 ite100 ukn100 eq184 hnf83 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...