./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/insertion_sort-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/insertion_sort-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 5e4c5ca624cdf20709f1f0e007d5ebfc90b8f799 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:48:56,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:48:56,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:48:56,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:48:56,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:48:56,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:48:56,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:48:56,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:48:56,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:48:56,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:48:56,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:48:56,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:48:56,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:48:56,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:48:56,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:48:56,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:48:56,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:48:56,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:48:56,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:48:56,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:48:56,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:48:56,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:48:56,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:48:56,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:48:56,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:48:56,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:48:56,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:48:56,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:48:56,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:48:56,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:48:56,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:48:57,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:48:57,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:48:57,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:48:57,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:48:57,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:48:57,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:48:57,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:48:57,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:48:57,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:48:57,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:48:57,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 20:48:57,042 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:48:57,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:48:57,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:48:57,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:48:57,046 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:48:57,046 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:48:57,046 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:48:57,046 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:48:57,047 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:48:57,047 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:48:57,048 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:48:57,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:48:57,049 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:48:57,050 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:48:57,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:48:57,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:48:57,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:48:57,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:48:57,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:48:57,051 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:48:57,052 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:48:57,052 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:48:57,052 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:48:57,052 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:48:57,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:48:57,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:48:57,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:48:57,054 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:48:57,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:48:57,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:48:57,054 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:48:57,056 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:48:57,057 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:48:57,057 INFO L138 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 5e4c5ca624cdf20709f1f0e007d5ebfc90b8f799 [2019-11-28 20:48:57,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:48:57,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:48:57,379 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:48:57,381 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:48:57,382 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:48:57,382 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/insertion_sort-1.c [2019-11-28 20:48:57,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66027b2e5/b5aec999801d457ba3a860333d3e3f8a/FLAGb2b328e7d [2019-11-28 20:48:57,912 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:48:57,913 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1.c [2019-11-28 20:48:57,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66027b2e5/b5aec999801d457ba3a860333d3e3f8a/FLAGb2b328e7d [2019-11-28 20:48:58,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66027b2e5/b5aec999801d457ba3a860333d3e3f8a [2019-11-28 20:48:58,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:48:58,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:48:58,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:48:58,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:48:58,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:48:58,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:48:58" (1/1) ... [2019-11-28 20:48:58,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245d122c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:58, skipping insertion in model container [2019-11-28 20:48:58,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:48:58" (1/1) ... [2019-11-28 20:48:58,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:48:58,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:48:58,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:48:58,569 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:48:58,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:48:58,616 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:48:58,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:58 WrapperNode [2019-11-28 20:48:58,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:48:58,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:48:58,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:48:58,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:48:58,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:58" (1/1) ... [2019-11-28 20:48:58,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:58" (1/1) ... [2019-11-28 20:48:58,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:48:58,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:48:58,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:48:58,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:48:58,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:58" (1/1) ... [2019-11-28 20:48:58,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:58" (1/1) ... [2019-11-28 20:48:58,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:58" (1/1) ... [2019-11-28 20:48:58,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:58" (1/1) ... [2019-11-28 20:48:58,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:58" (1/1) ... [2019-11-28 20:48:58,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:58" (1/1) ... [2019-11-28 20:48:58,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:58" (1/1) ... [2019-11-28 20:48:58,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:48:58,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:48:58,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:48:58,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:48:58,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 20:48:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:48:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:48:58,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:48:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:48:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:48:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:48:59,137 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:48:59,137 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-28 20:48:59,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:48:59 BoogieIcfgContainer [2019-11-28 20:48:59,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:48:59,139 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:48:59,140 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:48:59,146 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:48:59,148 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:48:59,148 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:48:58" (1/3) ... [2019-11-28 20:48:59,149 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f34b5fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:48:59, skipping insertion in model container [2019-11-28 20:48:59,150 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:48:59,150 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:58" (2/3) ... [2019-11-28 20:48:59,150 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f34b5fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:48:59, skipping insertion in model container [2019-11-28 20:48:59,150 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:48:59,151 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:48:59" (3/3) ... [2019-11-28 20:48:59,153 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertion_sort-1.c [2019-11-28 20:48:59,201 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:48:59,201 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:48:59,201 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:48:59,201 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:48:59,201 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:48:59,202 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:48:59,202 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:48:59,202 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:48:59,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 20:48:59,236 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-28 20:48:59,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:59,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:59,242 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:48:59,243 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:48:59,243 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:48:59,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 20:48:59,245 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-28 20:48:59,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:59,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:59,246 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:48:59,246 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:48:59,253 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 13#L14-3true [2019-11-28 20:48:59,253 INFO L796 eck$LassoCheckResult]: Loop: 13#L14-3true assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 16#L17-5true assume !true; 14#L17-6true call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 17#L14-2true main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 13#L14-3true [2019-11-28 20:48:59,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:59,259 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 20:48:59,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:59,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319785316] [2019-11-28 20:48:59,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:59,403 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:59,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:59,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1256252, now seen corresponding path program 1 times [2019-11-28 20:48:59,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:59,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613178465] [2019-11-28 20:48:59,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:48:59,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613178465] [2019-11-28 20:48:59,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:48:59,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:48:59,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61554633] [2019-11-28 20:48:59,446 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:48:59,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:59,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:48:59,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:48:59,467 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-11-28 20:48:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:59,476 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-11-28 20:48:59,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:48:59,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-11-28 20:48:59,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-28 20:48:59,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2019-11-28 20:48:59,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 20:48:59,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 20:48:59,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-28 20:48:59,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:59,487 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 20:48:59,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-28 20:48:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-28 20:48:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 20:48:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-28 20:48:59,521 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 20:48:59,521 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 20:48:59,521 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:48:59,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-28 20:48:59,522 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-28 20:48:59,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:59,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:59,523 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:48:59,523 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:48:59,523 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 53#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 54#L14-3 [2019-11-28 20:48:59,524 INFO L796 eck$LassoCheckResult]: Loop: 54#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 51#L17-5 main_#t~short4 := main_~i~0 >= 0; 48#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 49#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 59#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 60#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 54#L14-3 [2019-11-28 20:48:59,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:59,524 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-28 20:48:59,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:59,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23500218] [2019-11-28 20:48:59,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:59,554 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:59,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:59,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208494, now seen corresponding path program 1 times [2019-11-28 20:48:59,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:59,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881055390] [2019-11-28 20:48:59,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:59,621 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:59,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:59,622 INFO L82 PathProgramCache]: Analyzing trace with hash 268257712, now seen corresponding path program 1 times [2019-11-28 20:48:59,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:59,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719696915] [2019-11-28 20:48:59,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:59,751 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:59,978 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-11-28 20:49:00,237 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:49:00,242 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:49:00,243 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:49:00,243 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:49:00,243 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:49:00,244 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:00,245 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:49:00,245 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:49:00,246 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration2_Lasso [2019-11-28 20:49:00,246 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:49:00,246 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:49:00,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:00,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:00,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:00,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:00,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:00,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:00,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:00,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:00,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:00,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:00,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:00,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:00,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:00,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:00,724 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-11-28 20:49:01,073 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-11-28 20:49:01,153 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:49:01,158 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:01,167 INFO L120 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 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:01,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:01,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:01,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:01,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:01,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:01,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:01,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:01,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:01,193 INFO L120 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 [2019-11-28 20:49:01,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:01,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:01,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:01,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:01,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:01,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:01,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:01,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:01,233 INFO L120 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 [2019-11-28 20:49:01,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:01,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:01,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:01,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:01,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:01,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:01,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:01,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:01,259 INFO L120 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 [2019-11-28 20:49:01,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:01,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:01,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:01,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:01,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:01,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:01,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:01,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:01,298 INFO L120 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 [2019-11-28 20:49:01,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:01,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:01,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:01,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:01,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:01,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:01,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:01,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:01,318 INFO L120 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 [2019-11-28 20:49:01,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:01,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:01,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:01,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:01,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:01,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:01,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:01,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:01,346 INFO L120 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 [2019-11-28 20:49:01,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:01,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:01,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:01,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:01,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:01,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:01,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:01,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:01,365 INFO L120 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 [2019-11-28 20:49:01,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:01,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:01,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:01,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:01,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:01,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:01,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:01,388 INFO L120 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 [2019-11-28 20:49:01,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:01,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:01,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:01,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:01,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:01,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:01,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:01,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:01,413 INFO L120 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 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:01,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:01,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:01,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:01,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:01,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:01,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:01,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:01,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:01,431 INFO L120 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 [2019-11-28 20:49:01,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:01,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:01,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:01,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:01,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:01,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:01,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:01,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:01,450 INFO L120 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 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:01,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:01,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:01,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:01,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:01,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:01,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:01,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:01,484 INFO L120 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 [2019-11-28 20:49:01,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:01,487 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 20:49:01,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:01,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:01,502 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 20:49:01,502 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:01,532 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:49:01,633 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 20:49:01,634 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:01,641 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:01,645 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:49:01,646 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:49:01,646 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1, ULTIMATE.start_main_~#v~0.offset, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1 - 1*ULTIMATE.start_main_~#v~0.offset - 2*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-28 20:49:01,670 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-28 20:49:01,681 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:49:01,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:01,742 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:49:01,743 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:01,768 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:49:01,769 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:01,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:49:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:01,893 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 20:49:01,894 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-11-28 20:49:02,119 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 42 states and 59 transitions. Complement of second has 10 states. [2019-11-28 20:49:02,120 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 [2019-11-28 20:49:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:49:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2019-11-28 20:49:02,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-28 20:49:02,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:02,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-28 20:49:02,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:02,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 12 letters. [2019-11-28 20:49:02,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:02,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 59 transitions. [2019-11-28 20:49:02,130 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-28 20:49:02,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 35 states and 49 transitions. [2019-11-28 20:49:02,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-28 20:49:02,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 20:49:02,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 49 transitions. [2019-11-28 20:49:02,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:02,133 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 49 transitions. [2019-11-28 20:49:02,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 49 transitions. [2019-11-28 20:49:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-28 20:49:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 20:49:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2019-11-28 20:49:02,138 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 47 transitions. [2019-11-28 20:49:02,138 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 47 transitions. [2019-11-28 20:49:02,158 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:49:02,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 47 transitions. [2019-11-28 20:49:02,171 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-28 20:49:02,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:02,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:02,171 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:49:02,172 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:49:02,172 INFO L794 eck$LassoCheckResult]: Stem: 186#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 181#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 182#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 192#L17-5 [2019-11-28 20:49:02,172 INFO L796 eck$LassoCheckResult]: Loop: 192#L17-5 main_#t~short4 := main_~i~0 >= 0; 196#L17-1 assume !main_#t~short4; 198#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 187#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 188#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 191#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 192#L17-5 [2019-11-28 20:49:02,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:02,173 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2019-11-28 20:49:02,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:02,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554189095] [2019-11-28 20:49:02,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:02,243 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:02,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:02,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1336163126, now seen corresponding path program 1 times [2019-11-28 20:49:02,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:02,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40731173] [2019-11-28 20:49:02,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:02,263 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:02,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:02,264 INFO L82 PathProgramCache]: Analyzing trace with hash -272098468, now seen corresponding path program 1 times [2019-11-28 20:49:02,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:02,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309460098] [2019-11-28 20:49:02,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:02,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309460098] [2019-11-28 20:49:02,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:49:02,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:49:02,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540007567] [2019-11-28 20:49:02,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:02,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:49:02,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:49:02,436 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-11-28 20:49:02,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:02,509 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2019-11-28 20:49:02,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:49:02,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2019-11-28 20:49:02,511 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-11-28 20:49:02,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 53 transitions. [2019-11-28 20:49:02,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-28 20:49:02,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-28 20:49:02,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 53 transitions. [2019-11-28 20:49:02,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:02,513 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-11-28 20:49:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 53 transitions. [2019-11-28 20:49:02,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 25. [2019-11-28 20:49:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 20:49:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-11-28 20:49:02,516 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-28 20:49:02,516 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-28 20:49:02,516 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:49:02,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-11-28 20:49:02,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 20:49:02,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:02,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:02,518 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:49:02,518 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:49:02,518 INFO L794 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 266#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 267#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 268#L14-4 main_~k~0 := 1; 269#L24-3 [2019-11-28 20:49:02,518 INFO L796 eck$LassoCheckResult]: Loop: 269#L24-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 270#L4 assume !(0 == __VERIFIER_assert_~cond); 279#L4-2 havoc main_#t~mem8;havoc main_#t~mem7; 277#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 269#L24-3 [2019-11-28 20:49:02,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:02,519 INFO L82 PathProgramCache]: Analyzing trace with hash 925734, now seen corresponding path program 1 times [2019-11-28 20:49:02,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:02,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740957906] [2019-11-28 20:49:02,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:02,557 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:02,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:02,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 1 times [2019-11-28 20:49:02,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:02,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021157733] [2019-11-28 20:49:02,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:02,598 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:02,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:02,601 INFO L82 PathProgramCache]: Analyzing trace with hash 237874543, now seen corresponding path program 1 times [2019-11-28 20:49:02,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:02,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129726056] [2019-11-28 20:49:02,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:02,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129726056] [2019-11-28 20:49:02,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:49:02,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:49:02,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720280662] [2019-11-28 20:49:02,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:02,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:49:02,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:49:02,996 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-28 20:49:03,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:03,098 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-11-28 20:49:03,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:49:03,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 56 transitions. [2019-11-28 20:49:03,100 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-11-28 20:49:03,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 54 transitions. [2019-11-28 20:49:03,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 20:49:03,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 20:49:03,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 54 transitions. [2019-11-28 20:49:03,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:03,105 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2019-11-28 20:49:03,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 54 transitions. [2019-11-28 20:49:03,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25. [2019-11-28 20:49:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 20:49:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-28 20:49:03,111 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-28 20:49:03,111 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-28 20:49:03,112 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:49:03,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-11-28 20:49:03,113 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 20:49:03,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:03,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:03,114 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:49:03,114 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:49:03,114 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 345#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 346#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 353#L17-5 main_#t~short4 := main_~i~0 >= 0; 339#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 340#L17-3 [2019-11-28 20:49:03,114 INFO L796 eck$LassoCheckResult]: Loop: 340#L17-3 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 343#L18 assume main_~i~0 < 2;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5; 335#L18-2 main_~i~0 := main_~i~0 - 1; 336#L17-5 main_#t~short4 := main_~i~0 >= 0; 359#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 340#L17-3 [2019-11-28 20:49:03,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:03,116 INFO L82 PathProgramCache]: Analyzing trace with hash 28698826, now seen corresponding path program 1 times [2019-11-28 20:49:03,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:03,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790655239] [2019-11-28 20:49:03,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:03,171 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:03,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:03,174 INFO L82 PathProgramCache]: Analyzing trace with hash 53536832, now seen corresponding path program 1 times [2019-11-28 20:49:03,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:03,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921287679] [2019-11-28 20:49:03,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:03,195 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:03,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:03,195 INFO L82 PathProgramCache]: Analyzing trace with hash 99226903, now seen corresponding path program 1 times [2019-11-28 20:49:03,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:03,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473223379] [2019-11-28 20:49:03,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:03,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473223379] [2019-11-28 20:49:03,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061183053] [2019-11-28 20:49:03,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:49:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:03,305 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:49:03,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:03,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:49:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:03,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:49:03,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 20:49:03,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372019048] [2019-11-28 20:49:03,468 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-11-28 20:49:03,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:03,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:49:03,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:49:03,568 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 6 states. [2019-11-28 20:49:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:03,676 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2019-11-28 20:49:03,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:49:03,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 70 transitions. [2019-11-28 20:49:03,678 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2019-11-28 20:49:03,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 50 states and 61 transitions. [2019-11-28 20:49:03,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 20:49:03,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 20:49:03,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 61 transitions. [2019-11-28 20:49:03,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:03,680 INFO L688 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2019-11-28 20:49:03,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 61 transitions. [2019-11-28 20:49:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-11-28 20:49:03,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 20:49:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-28 20:49:03,683 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-28 20:49:03,684 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-28 20:49:03,684 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:49:03,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-11-28 20:49:03,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 20:49:03,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:03,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:03,685 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:49:03,685 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:49:03,685 INFO L794 eck$LassoCheckResult]: Stem: 478#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 473#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 474#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 479#L17-5 main_#t~short4 := main_~i~0 >= 0; 490#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 488#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 482#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 483#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 480#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 468#L17-5 [2019-11-28 20:49:03,685 INFO L796 eck$LassoCheckResult]: Loop: 468#L17-5 main_#t~short4 := main_~i~0 >= 0; 463#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 464#L17-3 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 471#L18 assume main_~i~0 < 2;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5; 467#L18-2 main_~i~0 := main_~i~0 - 1; 468#L17-5 [2019-11-28 20:49:03,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:03,686 INFO L82 PathProgramCache]: Analyzing trace with hash -273945510, now seen corresponding path program 2 times [2019-11-28 20:49:03,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:03,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294732961] [2019-11-28 20:49:03,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:03,714 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:03,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:03,715 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 2 times [2019-11-28 20:49:03,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:03,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333504217] [2019-11-28 20:49:03,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:03,724 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:03,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:03,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1968681057, now seen corresponding path program 1 times [2019-11-28 20:49:03,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:03,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631841800] [2019-11-28 20:49:03,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:03,768 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:04,136 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 85 [2019-11-28 20:49:04,451 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-11-28 20:49:04,454 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:49:04,454 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:49:04,454 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:49:04,454 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:49:04,454 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:49:04,455 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:04,455 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:49:04,455 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:49:04,455 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration6_Lasso [2019-11-28 20:49:04,455 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:49:04,455 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:49:04,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:04,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:04,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:04,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:04,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:04,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:04,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:04,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:04,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:04,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:04,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:04,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:04,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:04,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:04,991 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:49:04,997 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:05,020 INFO L120 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 [2019-11-28 20:49:05,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:05,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:05,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:05,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:05,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:05,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:05,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:05,026 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:05,034 INFO L120 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 [2019-11-28 20:49:05,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:05,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:05,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:05,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:05,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:05,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:05,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:05,064 INFO L120 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 [2019-11-28 20:49:05,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:05,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:05,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:05,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:05,076 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:05,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:05,090 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:49:05,128 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-28 20:49:05,128 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:05,142 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:05,146 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:49:05,146 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:49:05,146 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#v~0.base)_2) = 2*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_2 Supporting invariants [] [2019-11-28 20:49:05,171 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-28 20:49:05,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:49:05,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:05,215 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:49:05,216 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:05,226 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:49:05,228 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:05,277 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 [2019-11-28 20:49:05,278 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-28 20:49:05,346 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 70 states and 83 transitions. Complement of second has 9 states. [2019-11-28 20:49:05,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:49:05,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:49:05,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-11-28 20:49:05,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 9 letters. Loop has 5 letters. [2019-11-28 20:49:05,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:05,349 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:49:05,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:05,382 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:49:05,383 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:05,392 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:49:05,393 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:05,438 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 [2019-11-28 20:49:05,438 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-28 20:49:05,504 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 70 states and 83 transitions. Complement of second has 9 states. [2019-11-28 20:49:05,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:49:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:49:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-11-28 20:49:05,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 9 letters. Loop has 5 letters. [2019-11-28 20:49:05,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:05,506 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:49:05,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:05,538 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:49:05,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:05,549 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:49:05,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:05,597 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 [2019-11-28 20:49:05,597 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-28 20:49:05,662 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 71 states and 88 transitions. Complement of second has 8 states. [2019-11-28 20:49:05,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:49:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:49:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2019-11-28 20:49:05,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 9 letters. Loop has 5 letters. [2019-11-28 20:49:05,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:05,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 14 letters. Loop has 5 letters. [2019-11-28 20:49:05,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:05,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 9 letters. Loop has 10 letters. [2019-11-28 20:49:05,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:05,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 88 transitions. [2019-11-28 20:49:05,669 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 20:49:05,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 39 states and 46 transitions. [2019-11-28 20:49:05,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 20:49:05,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 20:49:05,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2019-11-28 20:49:05,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:05,670 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-11-28 20:49:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2019-11-28 20:49:05,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-11-28 20:49:05,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 20:49:05,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-11-28 20:49:05,674 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-28 20:49:05,674 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-28 20:49:05,674 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:49:05,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2019-11-28 20:49:05,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 20:49:05,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:05,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:05,677 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:49:05,677 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:49:05,677 INFO L794 eck$LassoCheckResult]: Stem: 914#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 909#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 910#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 917#L17-5 main_#t~short4 := main_~i~0 >= 0; 927#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 905#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 915#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 916#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 918#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 911#L14-4 main_~k~0 := 1; 912#L24-3 [2019-11-28 20:49:05,677 INFO L796 eck$LassoCheckResult]: Loop: 912#L24-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 913#L4 assume !(0 == __VERIFIER_assert_~cond); 921#L4-2 havoc main_#t~mem8;havoc main_#t~mem7; 920#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 912#L24-3 [2019-11-28 20:49:05,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:05,678 INFO L82 PathProgramCache]: Analyzing trace with hash 97623763, now seen corresponding path program 1 times [2019-11-28 20:49:05,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:05,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870879904] [2019-11-28 20:49:05,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:05,707 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:05,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:05,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 2 times [2019-11-28 20:49:05,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:05,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521118068] [2019-11-28 20:49:05,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:05,730 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:05,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:05,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1938296220, now seen corresponding path program 1 times [2019-11-28 20:49:05,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:05,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465259963] [2019-11-28 20:49:05,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:05,834 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:06,212 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 80 [2019-11-28 20:49:06,382 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-11-28 20:49:06,385 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:49:06,385 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:49:06,385 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:49:06,385 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:49:06,385 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:49:06,385 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:06,385 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:49:06,386 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:49:06,386 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration7_Lasso [2019-11-28 20:49:06,386 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:49:06,386 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:49:06,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:06,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:06,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:06,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:06,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:06,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:06,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:06,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:06,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:06,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:06,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:06,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:06,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:06,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:07,072 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:49:07,072 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:07,081 INFO L120 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 [2019-11-28 20:49:07,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:07,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:07,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:07,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:07,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:07,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:07,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:07,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:07,099 INFO L120 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 [2019-11-28 20:49:07,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:07,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:07,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:07,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:07,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:07,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:07,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:07,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:07,110 INFO L120 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 [2019-11-28 20:49:07,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:07,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:07,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:07,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:07,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:07,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:07,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:07,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:07,121 INFO L120 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 [2019-11-28 20:49:07,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:07,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:07,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:07,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:07,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:07,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:07,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:07,145 INFO L120 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 [2019-11-28 20:49:07,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:07,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:07,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:07,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:07,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:07,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:07,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:07,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:07,157 INFO L120 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 [2019-11-28 20:49:07,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:07,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:07,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:07,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:07,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:07,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:07,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:07,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:07,169 INFO L120 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 [2019-11-28 20:49:07,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:07,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:07,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:07,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:07,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:07,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:07,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:07,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:07,179 INFO L120 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 [2019-11-28 20:49:07,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:07,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:07,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:07,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:07,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:07,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:07,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:07,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:07,203 INFO L120 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 [2019-11-28 20:49:07,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:07,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:07,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:07,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:07,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:07,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:07,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:07,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:07,218 INFO L120 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 [2019-11-28 20:49:07,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:07,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:07,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:07,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:07,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:07,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:07,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:07,221 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:07,226 INFO L120 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 [2019-11-28 20:49:07,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:07,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:07,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:07,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:07,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:07,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:07,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:07,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:07,236 INFO L120 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 [2019-11-28 20:49:07,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:07,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:07,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:07,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:07,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:07,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:07,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:07,252 INFO L120 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 [2019-11-28 20:49:07,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:07,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:07,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:07,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:07,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:07,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:07,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:07,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:07,266 INFO L120 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 Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:07,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:07,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:07,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:07,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:07,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:07,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:07,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:07,283 INFO L120 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 [2019-11-28 20:49:07,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:07,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:07,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:07,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:07,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:07,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:07,321 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:49:07,359 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 20:49:07,359 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:07,365 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:07,368 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:49:07,368 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:49:07,368 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3, ULTIMATE.start_main_~#v~0.offset) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3 - 1*ULTIMATE.start_main_~#v~0.offset Supporting invariants [] [2019-11-28 20:49:07,389 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-28 20:49:07,391 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:49:07,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:07,425 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:49:07,425 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:07,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:49:07,435 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:07,458 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:49:07,459 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 20:49:07,480 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 31 states and 38 transitions. Complement of second has 4 states. [2019-11-28 20:49:07,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:49:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:49:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-11-28 20:49:07,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 20:49:07,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:07,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-28 20:49:07,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:07,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 8 letters. [2019-11-28 20:49:07,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:07,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-11-28 20:49:07,485 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:49:07,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2019-11-28 20:49:07,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:49:07,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:49:07,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:49:07,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:49:07,488 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:49:07,488 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:49:07,488 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:49:07,488 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:49:07,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:49:07,489 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:49:07,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:49:07,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:49:07 BoogieIcfgContainer [2019-11-28 20:49:07,503 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:49:07,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:49:07,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:49:07,505 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:49:07,506 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:48:59" (3/4) ... [2019-11-28 20:49:07,513 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:49:07,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:49:07,515 INFO L168 Benchmark]: Toolchain (without parser) took 9213.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.0 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -80.6 MB). Peak memory consumption was 231.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:07,520 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:49:07,529 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.78 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:07,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:07,536 INFO L168 Benchmark]: Boogie Preprocessor took 35.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:49:07,537 INFO L168 Benchmark]: RCFGBuilder took 368.62 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: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:07,537 INFO L168 Benchmark]: BuchiAutomizer took 8363.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.5 MB). Peak memory consumption was 238.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:07,538 INFO L168 Benchmark]: Witness Printer took 7.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:49:07,544 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.78 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 368.62 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: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8363.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.5 MB). Peak memory consumption was 238.8 MB. Max. memory is 11.5 GB. * Witness Printer took 7.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[v] + -1 * v + -2 * j and consists of 6 locations. One deterministic module has affine ranking function -4 * k + unknown-#length-unknown[v] + -1 * v and consists of 3 locations. One nondeterministic module has affine ranking function 2 * i + unknown-#length-unknown[v] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 6.7s. Construction of modules took 0.3s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 63 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 146 SDtfs, 230 SDslu, 167 SDs, 0 SdLazy, 230 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital181 mio100 ax100 hnf99 lsp95 ukn64 mio100 lsp77 div222 bol100 ite100 ukn100 eq148 hnf58 smp86 dnf129 smp87 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 179ms VariablesStem: 6 VariablesLoop: 10 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...