./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 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/termination-memory-alloca/selectionsort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 7a61d79c4ca9451b26ba6dc1b90600e9ebfec9cf ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 18:48:01,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:48:01,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:48:01,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:48:01,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:48:01,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:48:01,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:48:01,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:48:01,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:48:01,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:48:01,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:48:01,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:48:01,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:48:01,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:48:01,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:48:01,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:48:01,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:48:01,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:48:01,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:48:01,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:48:01,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:48:01,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:48:01,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:48:01,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:48:01,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:48:01,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:48:01,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:48:01,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:48:01,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:48:01,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:48:01,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:48:01,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:48:01,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:48:01,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:48:01,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:48:01,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:48:01,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:48:01,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:48:01,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:48:01,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:48:01,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:48:01,999 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-19 18:48:02,049 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:48:02,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:48:02,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:48:02,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:48:02,052 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:48:02,052 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:48:02,052 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:48:02,052 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:48:02,053 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:48:02,053 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:48:02,054 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:48:02,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:48:02,054 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:48:02,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:48:02,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:48:02,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:48:02,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:48:02,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:48:02,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:48:02,056 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:48:02,056 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:48:02,056 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:48:02,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:48:02,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:48:02,057 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:48:02,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:48:02,058 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:48:02,058 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:48:02,058 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:48:02,059 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:48:02,060 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a61d79c4ca9451b26ba6dc1b90600e9ebfec9cf [2020-10-19 18:48:02,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:48:02,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:48:02,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:48:02,410 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:48:02,417 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:48:02,418 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2020-10-19 18:48:02,482 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0040dee9/a6e276682fa14679889aabdf1491eb9b/FLAG4ed47bbfe [2020-10-19 18:48:03,026 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:48:03,027 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2020-10-19 18:48:03,043 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0040dee9/a6e276682fa14679889aabdf1491eb9b/FLAG4ed47bbfe [2020-10-19 18:48:03,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0040dee9/a6e276682fa14679889aabdf1491eb9b [2020-10-19 18:48:03,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:48:03,342 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:48:03,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:48:03,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:48:03,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:48:03,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:48:03" (1/1) ... [2020-10-19 18:48:03,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e15684e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:03, skipping insertion in model container [2020-10-19 18:48:03,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:48:03" (1/1) ... [2020-10-19 18:48:03,363 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:48:03,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:48:03,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:48:03,769 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:48:03,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:48:03,881 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:48:03,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:03 WrapperNode [2020-10-19 18:48:03,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:48:03,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:48:03,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:48:03,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:48:03,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:03" (1/1) ... [2020-10-19 18:48:03,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:03" (1/1) ... [2020-10-19 18:48:03,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:48:03,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:48:03,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:48:03,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:48:03,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:03" (1/1) ... [2020-10-19 18:48:03,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:03" (1/1) ... [2020-10-19 18:48:03,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:03" (1/1) ... [2020-10-19 18:48:03,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:03" (1/1) ... [2020-10-19 18:48:03,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:03" (1/1) ... [2020-10-19 18:48:03,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:03" (1/1) ... [2020-10-19 18:48:03,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:03" (1/1) ... [2020-10-19 18:48:03,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:48:03,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:48:03,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:48:03,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:48:03,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:03" (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 [2020-10-19 18:48:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 18:48:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 18:48:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 18:48:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 18:48:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:48:04,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:48:04,248 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:48:04,249 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-19 18:48:04,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:48:04 BoogieIcfgContainer [2020-10-19 18:48:04,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:48:04,252 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:48:04,252 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:48:04,256 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:48:04,257 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:48:04,258 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:48:03" (1/3) ... [2020-10-19 18:48:04,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50cd1f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:48:04, skipping insertion in model container [2020-10-19 18:48:04,259 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:48:04,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:03" (2/3) ... [2020-10-19 18:48:04,260 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50cd1f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:48:04, skipping insertion in model container [2020-10-19 18:48:04,260 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:48:04,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:48:04" (3/3) ... [2020-10-19 18:48:04,262 INFO L373 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-2.i [2020-10-19 18:48:04,346 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:48:04,346 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:48:04,346 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:48:04,346 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:48:04,347 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:48:04,347 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:48:04,348 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:48:04,348 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:48:04,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-10-19 18:48:04,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-19 18:48:04,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:48:04,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:48:04,399 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:48:04,399 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 18:48:04,399 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:48:04,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-10-19 18:48:04,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-19 18:48:04,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:48:04,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:48:04,402 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:48:04,403 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 18:48:04,411 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 7#L566true assume !(main_~array_size~0 < 1); 9#L566-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 4#L550-3true [2020-10-19 18:48:04,412 INFO L796 eck$LassoCheckResult]: Loop: 4#L550-3true assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 12#L554-3true assume !true; 14#L554-4true call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3#L550-2true SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 4#L550-3true [2020-10-19 18:48:04,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:04,420 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-10-19 18:48:04,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:04,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276980994] [2020-10-19 18:48:04,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:04,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:04,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:04,581 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:04,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:04,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2020-10-19 18:48:04,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:04,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531910462] [2020-10-19 18:48:04,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:48:04,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531910462] [2020-10-19 18:48:04,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:48:04,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 18:48:04,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352639889] [2020-10-19 18:48:04,638 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:48:04,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:48:04,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-19 18:48:04,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-19 18:48:04,653 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2020-10-19 18:48:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:48:04,660 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2020-10-19 18:48:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-19 18:48:04,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2020-10-19 18:48:04,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-19 18:48:04,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2020-10-19 18:48:04,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 18:48:04,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-19 18:48:04,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2020-10-19 18:48:04,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:48:04,669 INFO L691 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-10-19 18:48:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2020-10-19 18:48:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-10-19 18:48:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-19 18:48:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-10-19 18:48:04,695 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-10-19 18:48:04,695 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-10-19 18:48:04,695 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:48:04,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-10-19 18:48:04,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-19 18:48:04,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:48:04,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:48:04,697 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:48:04,697 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 18:48:04,697 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 38#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 39#L566 assume !(main_~array_size~0 < 1); 40#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 37#L550-3 [2020-10-19 18:48:04,697 INFO L796 eck$LassoCheckResult]: Loop: 37#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 42#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 44#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 36#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 37#L550-3 [2020-10-19 18:48:04,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:04,698 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2020-10-19 18:48:04,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:04,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008505806] [2020-10-19 18:48:04,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:04,710 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:04,719 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:04,723 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:04,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:04,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2020-10-19 18:48:04,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:04,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241005468] [2020-10-19 18:48:04,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:48:04,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241005468] [2020-10-19 18:48:04,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:48:04,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 18:48:04,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382344468] [2020-10-19 18:48:04,779 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:48:04,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:48:04,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:48:04,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:48:04,781 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-19 18:48:04,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:48:04,822 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-10-19 18:48:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:48:04,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2020-10-19 18:48:04,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-19 18:48:04,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2020-10-19 18:48:04,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-19 18:48:04,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 18:48:04,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2020-10-19 18:48:04,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:48:04,826 INFO L691 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-10-19 18:48:04,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2020-10-19 18:48:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-10-19 18:48:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-19 18:48:04,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-10-19 18:48:04,829 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-10-19 18:48:04,829 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-10-19 18:48:04,829 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:48:04,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2020-10-19 18:48:04,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-19 18:48:04,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:48:04,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:48:04,831 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:48:04,831 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:48:04,832 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 63#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 64#L566 assume !(main_~array_size~0 < 1); 65#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 66#L550-3 [2020-10-19 18:48:04,832 INFO L796 eck$LassoCheckResult]: Loop: 66#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 69#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 72#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 70#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 71#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 73#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 67#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 66#L550-3 [2020-10-19 18:48:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:04,833 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2020-10-19 18:48:04,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:04,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832324911] [2020-10-19 18:48:04,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:04,845 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:04,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:04,857 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:04,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:04,858 INFO L82 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2020-10-19 18:48:04,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:04,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491746033] [2020-10-19 18:48:04,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:04,880 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:04,898 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:04,903 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:04,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:04,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2020-10-19 18:48:04,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:04,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905916357] [2020-10-19 18:48:04,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:04,931 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:04,969 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:04,979 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:05,144 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2020-10-19 18:48:05,346 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-10-19 18:48:05,420 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:48:05,421 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:48:05,421 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:48:05,421 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:48:05,421 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:48:05,422 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:05,422 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:48:05,422 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:48:05,422 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration3_Lasso [2020-10-19 18:48:05,423 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:48:05,423 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:48:05,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:05,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:05,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:05,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:05,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:05,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:05,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:05,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:05,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:05,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:05,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:05,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:05,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:05,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:06,123 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:48:06,129 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) [2020-10-19 18:48:06,135 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 [2020-10-19 18:48:06,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:06,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:06,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:06,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:06,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:06,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:06,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:06,149 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) [2020-10-19 18:48:06,195 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 [2020-10-19 18:48:06,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:06,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:06,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:06,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:06,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:06,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:06,200 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 [2020-10-19 18:48:06,202 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) [2020-10-19 18:48:06,244 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 [2020-10-19 18:48:06,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:06,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:06,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:06,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:06,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:48:06,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:06,257 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) [2020-10-19 18:48:06,294 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 [2020-10-19 18:48:06,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:06,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:06,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:06,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:06,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:48:06,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:06,310 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) [2020-10-19 18:48:06,345 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 [2020-10-19 18:48:06,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:06,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:06,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:06,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:06,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:48:06,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:48:06,386 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:48:06,450 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-19 18:48:06,450 INFO L444 ModelExtractionUtils]: 23 out of 40 variables were initially zero. Simplification set additionally 13 variables to zero. 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) [2020-10-19 18:48:06,457 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:06,461 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 18:48:06,461 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:48:06,462 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1, ULTIMATE.start_SelectionSort_~i~0) = 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1 - 4*ULTIMATE.start_SelectionSort_~i~0 Supporting invariants [1*ULTIMATE.start_SelectionSort_~a.offset >= 0] [2020-10-19 18:48:06,548 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2020-10-19 18:48:06,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:48:06,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:06,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:48:06,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:48:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:06,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:48:06,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:48:06,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:48:06,707 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 [2020-10-19 18:48:06,708 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-10-19 18:48:06,827 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 18 states and 24 transitions. Complement of second has 6 states. [2020-10-19 18:48:06,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:48:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:48:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-10-19 18:48:06,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 7 letters. [2020-10-19 18:48:06,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:48:06,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 7 letters. [2020-10-19 18:48:06,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:48:06,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 14 letters. [2020-10-19 18:48:06,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:48:06,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2020-10-19 18:48:06,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:48:06,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2020-10-19 18:48:06,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-19 18:48:06,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-19 18:48:06,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-10-19 18:48:06,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:48:06,839 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-19 18:48:06,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-10-19 18:48:06,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-10-19 18:48:06,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-19 18:48:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2020-10-19 18:48:06,842 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-10-19 18:48:06,843 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-10-19 18:48:06,843 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:48:06,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2020-10-19 18:48:06,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:48:06,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:48:06,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:48:06,845 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 18:48:06,845 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:48:06,845 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 177#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 178#L566 assume !(main_~array_size~0 < 1); 179#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 180#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 182#L554-3 [2020-10-19 18:48:06,846 INFO L796 eck$LassoCheckResult]: Loop: 182#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 187#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 184#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 182#L554-3 [2020-10-19 18:48:06,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:06,846 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2020-10-19 18:48:06,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:06,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253249219] [2020-10-19 18:48:06,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:06,859 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:06,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:06,872 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:06,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:06,872 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2020-10-19 18:48:06,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:06,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916840662] [2020-10-19 18:48:06,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:06,882 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:06,888 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:06,891 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:06,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:06,892 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2020-10-19 18:48:06,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:06,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317163389] [2020-10-19 18:48:06,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:06,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:06,925 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:06,930 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:07,248 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-10-19 18:48:07,308 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:48:07,308 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:48:07,308 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:48:07,308 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:48:07,309 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:48:07,309 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:07,309 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:48:07,309 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:48:07,309 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration4_Lasso [2020-10-19 18:48:07,309 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:48:07,309 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:48:07,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:07,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:07,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:07,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:07,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:07,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:07,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:07,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:07,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:07,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:07,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:07,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:07,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:07,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:07,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:07,841 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:48:07,842 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:07,849 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 [2020-10-19 18:48:07,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:07,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:07,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:07,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:07,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:07,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:07,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:48:07,860 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) [2020-10-19 18:48:07,915 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 [2020-10-19 18:48:07,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:07,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:07,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:07,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:07,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:07,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:07,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:07,921 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) [2020-10-19 18:48:07,972 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 [2020-10-19 18:48:07,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:07,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:07,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:07,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:07,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:07,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:07,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:07,978 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:48:08,023 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 [2020-10-19 18:48:08,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:08,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:08,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:08,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:08,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:08,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:08,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:08,036 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) [2020-10-19 18:48:08,083 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 [2020-10-19 18:48:08,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:08,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:08,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:08,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:08,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:48:08,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:08,096 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:08,141 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 [2020-10-19 18:48:08,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:08,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:08,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:08,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:08,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:08,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:08,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:48:08,148 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 [2020-10-19 18:48:08,186 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 [2020-10-19 18:48:08,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:08,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:08,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:08,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:08,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:48:08,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:48:08,202 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 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:08,245 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 [2020-10-19 18:48:08,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:08,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:08,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:08,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:08,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:48:08,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:48:08,263 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:48:08,321 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 [2020-10-19 18:48:08,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:08,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:08,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:08,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:08,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:08,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:08,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:08,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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:48:08,373 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 [2020-10-19 18:48:08,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:08,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:08,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:08,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:08,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:48:08,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:48:08,380 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) [2020-10-19 18:48:08,426 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 [2020-10-19 18:48:08,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:08,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:08,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:08,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:08,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:08,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:48:08,459 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:48:08,491 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-19 18:48:08,491 INFO L444 ModelExtractionUtils]: 20 out of 40 variables were initially zero. Simplification set additionally 17 variables to zero. 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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:08,495 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:48:08,497 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:48:08,497 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:48:08,498 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~j~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2020-10-19 18:48:08,536 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-10-19 18:48:08,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:08,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:48:08,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:48:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:08,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:48:08,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:48:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:48:08,590 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 [2020-10-19 18:48:08,590 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-10-19 18:48:08,626 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 7 states. [2020-10-19 18:48:08,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:48:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:48:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-10-19 18:48:08,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2020-10-19 18:48:08,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:48:08,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2020-10-19 18:48:08,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:48:08,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2020-10-19 18:48:08,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:48:08,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2020-10-19 18:48:08,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:48:08,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2020-10-19 18:48:08,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-19 18:48:08,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-10-19 18:48:08,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2020-10-19 18:48:08,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:48:08,639 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-10-19 18:48:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2020-10-19 18:48:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2020-10-19 18:48:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-19 18:48:08,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-10-19 18:48:08,642 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-19 18:48:08,642 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-19 18:48:08,642 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 18:48:08,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-10-19 18:48:08,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:48:08,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:48:08,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:48:08,647 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:48:08,647 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:48:08,647 INFO L794 eck$LassoCheckResult]: Stem: 293#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 289#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 290#L566 assume !(main_~array_size~0 < 1); 291#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 292#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 294#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 300#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 297#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 298#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 301#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 287#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 288#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 295#L554-3 [2020-10-19 18:48:08,647 INFO L796 eck$LassoCheckResult]: Loop: 295#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 299#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 296#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 295#L554-3 [2020-10-19 18:48:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:08,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2020-10-19 18:48:08,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:08,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230301410] [2020-10-19 18:48:08,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:48:08,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230301410] [2020-10-19 18:48:08,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802686464] [2020-10-19 18:48:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:48:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:08,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:48:08,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:48:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:48:08,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:48:08,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-19 18:48:08,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645253294] [2020-10-19 18:48:08,786 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:48:08,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:08,786 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2020-10-19 18:48:08,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:08,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465936666] [2020-10-19 18:48:08,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:08,793 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:08,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:08,799 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:08,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:48:08,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 18:48:08,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-19 18:48:08,846 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2020-10-19 18:48:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:48:08,905 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2020-10-19 18:48:08,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 18:48:08,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2020-10-19 18:48:08,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:48:08,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2020-10-19 18:48:08,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 18:48:08,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 18:48:08,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2020-10-19 18:48:08,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:48:08,909 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-10-19 18:48:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2020-10-19 18:48:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2020-10-19 18:48:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-19 18:48:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2020-10-19 18:48:08,911 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-10-19 18:48:08,912 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-10-19 18:48:08,912 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 18:48:08,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2020-10-19 18:48:08,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:48:08,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:48:08,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:48:08,913 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:48:08,914 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:48:08,914 INFO L794 eck$LassoCheckResult]: Stem: 383#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 377#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 378#L566 assume !(main_~array_size~0 < 1); 379#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 380#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 384#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 394#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 387#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 388#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 390#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 391#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 393#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 392#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 381#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 382#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 385#L554-3 [2020-10-19 18:48:08,914 INFO L796 eck$LassoCheckResult]: Loop: 385#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 389#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 386#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 385#L554-3 [2020-10-19 18:48:08,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:08,914 INFO L82 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2020-10-19 18:48:08,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:08,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499195652] [2020-10-19 18:48:08,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:08,938 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:08,957 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:08,963 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:08,964 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2020-10-19 18:48:08,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:08,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084309282] [2020-10-19 18:48:08,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:08,975 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:08,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:08,988 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:08,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:08,988 INFO L82 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2020-10-19 18:48:08,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:08,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660379410] [2020-10-19 18:48:08,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:09,042 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:09,084 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:09,098 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:09,544 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 108 [2020-10-19 18:48:09,638 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:48:09,638 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:48:09,638 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:48:09,638 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:48:09,639 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:48:09,639 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:09,639 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:48:09,639 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:48:09,639 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration6_Lasso [2020-10-19 18:48:09,639 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:48:09,639 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:48:09,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:09,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:09,872 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2020-10-19 18:48:09,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:09,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:09,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:09,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:09,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:09,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:09,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:09,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:09,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:09,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:09,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:09,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:10,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:10,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:10,377 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:48:10,377 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 [2020-10-19 18:48:10,391 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 [2020-10-19 18:48:10,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:10,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:10,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:10,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:10,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:10,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:10,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:48:10,400 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 [2020-10-19 18:48:10,429 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 [2020-10-19 18:48:10,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:10,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:10,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:10,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:10,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:48:10,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:48:10,442 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) [2020-10-19 18:48:10,486 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 [2020-10-19 18:48:10,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:10,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:10,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:10,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:10,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:48:10,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:10,503 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) [2020-10-19 18:48:10,536 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 [2020-10-19 18:48:10,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:10,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:10,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:10,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:10,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:48:10,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:48:10,549 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:10,569 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 [2020-10-19 18:48:10,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:10,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:10,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:10,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:10,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:10,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:10,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:48:10,573 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 [2020-10-19 18:48:10,594 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 [2020-10-19 18:48:10,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:10,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:10,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:10,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:10,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:48:10,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:48:10,600 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 [2020-10-19 18:48:10,632 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 [2020-10-19 18:48:10,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:10,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:10,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:10,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:10,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:48:10,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:48:10,660 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:48:10,704 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-10-19 18:48:10,704 INFO L444 ModelExtractionUtils]: 6 out of 31 variables were initially zero. Simplification set additionally 21 variables to zero. 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) [2020-10-19 18:48:10,712 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:10,720 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 18:48:10,720 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:48:10,720 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3) = -4*ULTIMATE.start_SelectionSort_~j~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3 Supporting invariants [1*ULTIMATE.start_SelectionSort_~a.offset >= 0] [2020-10-19 18:48:10,778 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2020-10-19 18:48:10,780 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:48:10,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:10,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:48:10,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:48:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:10,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:48:10,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:48:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:48:10,875 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-19 18:48:10,875 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-19 18:48:10,937 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 35 states and 48 transitions. Complement of second has 8 states. [2020-10-19 18:48:10,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:48:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:48:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-10-19 18:48:10,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-19 18:48:10,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:48:10,939 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:48:10,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:10,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:48:10,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:48:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:11,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:48:11,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:48:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:48:11,054 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-19 18:48:11,054 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-19 18:48:11,103 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 35 states and 48 transitions. Complement of second has 8 states. [2020-10-19 18:48:11,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:48:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:48:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-10-19 18:48:11,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-19 18:48:11,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:48:11,104 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:48:11,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:11,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:48:11,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:48:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:11,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:48:11,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:48:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:48:11,192 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-19 18:48:11,192 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-19 18:48:11,257 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 39 transitions. Complement of second has 7 states. [2020-10-19 18:48:11,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:48:11,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:48:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-10-19 18:48:11,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-19 18:48:11,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:48:11,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2020-10-19 18:48:11,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:48:11,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 15 letters. Loop has 6 letters. [2020-10-19 18:48:11,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:48:11,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 39 transitions. [2020-10-19 18:48:11,262 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:48:11,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2020-10-19 18:48:11,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 18:48:11,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 18:48:11,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 18:48:11,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:48:11,262 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:48:11,262 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:48:11,262 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:48:11,262 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 18:48:11,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 18:48:11,263 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:48:11,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 18:48:11,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 06:48:11 BoogieIcfgContainer [2020-10-19 18:48:11,272 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 18:48:11,273 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 18:48:11,273 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 18:48:11,273 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 18:48:11,274 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:48:04" (3/4) ... [2020-10-19 18:48:11,277 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 18:48:11,277 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 18:48:11,279 INFO L168 Benchmark]: Toolchain (without parser) took 7942.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 269.0 MB). Free memory was 955.9 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 109.9 MB. Max. memory is 11.5 GB. [2020-10-19 18:48:11,279 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:48:11,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 538.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -118.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2020-10-19 18:48:11,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:48:11,281 INFO L168 Benchmark]: Boogie Preprocessor took 26.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:48:11,282 INFO L168 Benchmark]: RCFGBuilder took 296.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2020-10-19 18:48:11,286 INFO L168 Benchmark]: BuchiAutomizer took 7020.46 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -80.2 MB). Peak memory consumption was 99.1 MB. Max. memory is 11.5 GB. [2020-10-19 18:48:11,286 INFO L168 Benchmark]: Witness Printer took 4.57 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2020-10-19 18:48:11,290 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 538.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -118.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 296.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7020.46 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -80.2 MB). Peak memory consumption was 99.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.57 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[a] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * j + array_size and consists of 4 locations. One nondeterministic module has affine ranking function -4 * j + unknown-#length-unknown[a] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 81 SDtfs, 90 SDslu, 46 SDs, 0 SdLazy, 101 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital189 mio100 ax109 hnf99 lsp86 ukn79 mio100 lsp69 div100 bol100 ite100 ukn100 eq170 hnf86 smp95 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...