./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/RecursiveMultiplication-1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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-crafted/RecursiveMultiplication-1.c -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 3df7720ba3b76dcfdecddff77e2f89a40d99e447 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:27:46,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:27:46,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:27:46,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:27:46,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:27:46,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:27:46,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:27:46,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:27:46,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:27:46,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:27:46,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:27:46,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:27:46,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:27:46,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:27:46,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:27:46,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:27:46,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:27:46,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:27:46,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:27:46,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:27:46,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:27:46,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:27:46,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:27:46,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:27:46,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:27:46,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:27:46,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:27:46,661 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:27:46,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:27:46,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:27:46,663 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:27:46,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:27:46,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:27:46,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:27:46,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:27:46,668 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:27:46,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:27:46,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:27:46,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:27:46,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:27:46,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:27:46,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:27:46,715 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:27:46,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:27:46,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:27:46,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:27:46,720 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:27:46,720 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:27:46,720 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:27:46,721 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:27:46,721 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:27:46,722 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:27:46,723 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:27:46,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:27:46,724 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:27:46,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:27:46,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:27:46,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:27:46,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:27:46,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:27:46,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:27:46,727 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:27:46,728 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:27:46,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:27:46,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:27:46,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:27:46,732 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:27:46,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:27:46,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:27:46,733 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:27:46,734 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:27:46,735 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:27:46,736 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 -> 3df7720ba3b76dcfdecddff77e2f89a40d99e447 [2020-07-29 01:27:47,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:27:47,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:27:47,053 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:27:47,055 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:27:47,055 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:27:47,056 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/RecursiveMultiplication-1.c [2020-07-29 01:27:47,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/364b2cfb1/ec0ec565a891400b838fa1c27b3605c2/FLAGd494f33dc [2020-07-29 01:27:47,573 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:27:47,573 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/RecursiveMultiplication-1.c [2020-07-29 01:27:47,581 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/364b2cfb1/ec0ec565a891400b838fa1c27b3605c2/FLAGd494f33dc [2020-07-29 01:27:47,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/364b2cfb1/ec0ec565a891400b838fa1c27b3605c2 [2020-07-29 01:27:47,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:27:47,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:27:47,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:27:47,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:27:47,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:27:47,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:27:47" (1/1) ... [2020-07-29 01:27:47,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fc015a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:47, skipping insertion in model container [2020-07-29 01:27:47,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:27:47" (1/1) ... [2020-07-29 01:27:47,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:27:48,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:27:48,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:27:48,163 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:27:48,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:27:48,195 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:27:48,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:48 WrapperNode [2020-07-29 01:27:48,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:27:48,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:27:48,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:27:48,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:27:48,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:48" (1/1) ... [2020-07-29 01:27:48,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:48" (1/1) ... [2020-07-29 01:27:48,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:27:48,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:27:48,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:27:48,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:27:48,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:48" (1/1) ... [2020-07-29 01:27:48,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:48" (1/1) ... [2020-07-29 01:27:48,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:48" (1/1) ... [2020-07-29 01:27:48,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:48" (1/1) ... [2020-07-29 01:27:48,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:48" (1/1) ... [2020-07-29 01:27:48,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:48" (1/1) ... [2020-07-29 01:27:48,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:48" (1/1) ... [2020-07-29 01:27:48,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:27:48,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:27:48,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:27:48,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:27:48,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:48" (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-07-29 01:27:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2020-07-29 01:27:48,369 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2020-07-29 01:27:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:27:48,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:27:48,666 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:27:48,666 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-29 01:27:48,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:27:48 BoogieIcfgContainer [2020-07-29 01:27:48,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:27:48,673 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:27:48,673 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:27:48,678 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:27:48,679 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:27:48,680 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:27:47" (1/3) ... [2020-07-29 01:27:48,681 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c45b9c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:27:48, skipping insertion in model container [2020-07-29 01:27:48,682 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:27:48,682 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:48" (2/3) ... [2020-07-29 01:27:48,683 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c45b9c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:27:48, skipping insertion in model container [2020-07-29 01:27:48,683 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:27:48,683 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:27:48" (3/3) ... [2020-07-29 01:27:48,685 INFO L371 chiAutomizerObserver]: Analyzing ICFG RecursiveMultiplication-1.c [2020-07-29 01:27:48,752 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:27:48,752 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:27:48,752 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:27:48,753 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:27:48,753 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:27:48,753 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:27:48,753 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:27:48,754 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:27:48,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 01:27:48,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:27:48,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:48,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:48,812 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:27:48,812 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:48,812 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:27:48,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 01:27:48,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:27:48,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:48,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:48,818 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:27:48,818 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:48,826 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~res~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 3#L26true assume !!(-65535 <= main_~m~0 && main_~m~0 <= 65535); 6#L27true assume !!(-65535 <= main_~n~0 && main_~n~0 <= 65535); 8#L28true call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 4#multENTRYtrue [2020-07-29 01:27:48,826 INFO L796 eck$LassoCheckResult]: Loop: 4#multENTRYtrue ~n := #in~n;~m := #in~m; 11#L13true assume ~m < 0; 9#L14true call #t~ret0 := mult(~n, -~m);< 4#multENTRYtrue [2020-07-29 01:27:48,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:48,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1390416, now seen corresponding path program 1 times [2020-07-29 01:27:48,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:48,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972329468] [2020-07-29 01:27:48,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,941 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:48,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:48,943 INFO L82 PathProgramCache]: Analyzing trace with hash 29915, now seen corresponding path program 1 times [2020-07-29 01:27:48,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:48,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334911538] [2020-07-29 01:27:48,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,964 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,966 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:48,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:48,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1527789780, now seen corresponding path program 1 times [2020-07-29 01:27:48,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:48,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88068820] [2020-07-29 01:27:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,997 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:49,188 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:49,189 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:49,189 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:49,190 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:49,190 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:27:49,190 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:49,190 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:49,190 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:49,191 INFO L133 ssoRankerPreferences]: Filename of dumped script: RecursiveMultiplication-1.c_Iteration1_Loop [2020-07-29 01:27:49,191 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:49,191 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:49,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,431 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:49,432 INFO L404 LassoAnalysis]: Checking for nontermination... 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-07-29 01:27:49,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:49,439 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:49,451 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:49,452 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-07-29 01:27:49,496 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:49,497 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:49,501 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:49,501 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-07-29 01:27:49,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:49,543 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:49,548 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:49,548 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:49,594 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:49,594 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:49,599 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:49,599 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-07-29 01:27:49,628 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:49,628 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:49,635 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:49,636 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-07-29 01:27:49,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:49,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:49,687 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:49,687 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:49,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:49,728 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:49,769 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:27:49,769 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:49,832 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:27:49,835 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:49,835 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:49,835 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:49,836 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:49,836 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:27:49,836 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:49,836 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:49,836 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:49,836 INFO L133 ssoRankerPreferences]: Filename of dumped script: RecursiveMultiplication-1.c_Iteration1_Loop [2020-07-29 01:27:49,837 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:49,837 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:49,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:50,068 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:50,075 INFO L489 LassoAnalysis]: Using template 'affine'. 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-07-29 01:27:50,082 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-07-29 01:27:50,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:50,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:50,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:50,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:50,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:50,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:50,092 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-07-29 01:27:50,098 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-07-29 01:27:50,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:50,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:50,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:50,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:50,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:50,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:50,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:50,161 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-07-29 01:27:50,163 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-07-29 01:27:50,211 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-07-29 01:27:50,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:50,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:50,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:50,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:50,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:50,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:50,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:50,218 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) [2020-07-29 01:27:50,271 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-07-29 01:27:50,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:50,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:50,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:50,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:50,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:50,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:50,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:50,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:50,327 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-07-29 01:27:50,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:50,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:50,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:50,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:50,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:50,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:50,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:50,342 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-07-29 01:27:50,384 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-07-29 01:27:50,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:50,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:50,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:50,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:50,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:50,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:50,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:50,392 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-07-29 01:27:50,439 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-07-29 01:27:50,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:50,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:50,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:50,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:50,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:50,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:50,445 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-07-29 01:27:50,449 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:27:50,496 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:27:50,496 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:50,545 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:27:50,545 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:27:50,545 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:27:50,546 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2020-07-29 01:27:50,591 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:27:50,597 INFO L393 LassoCheck]: Loop: "~n := #in~n;~m := #in~m;" "assume ~m < 0;" "call #t~ret0 := mult(~n, -~m);"< [2020-07-29 01:27:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:50,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:50,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:27:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:50,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:50,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~res~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {27#unseeded} is VALID [2020-07-29 01:27:50,710 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#unseeded} assume !!(-65535 <= main_~m~0 && main_~m~0 <= 65535); {27#unseeded} is VALID [2020-07-29 01:27:50,712 INFO L280 TraceCheckUtils]: 2: Hoare triple {27#unseeded} assume !!(-65535 <= main_~n~0 && main_~n~0 <= 65535); {27#unseeded} is VALID [2020-07-29 01:27:50,714 INFO L263 TraceCheckUtils]: 3: Hoare triple {27#unseeded} call main_#t~ret4 := mult(main_~m~0, main_~n~0); {27#unseeded} is VALID [2020-07-29 01:27:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:50,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:27:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:50,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:50,849 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#(>= oldRank0 (* (- 1) |mult_#in~m|))} ~n := #in~n;~m := #in~m; {54#(<= 0 (+ mult_~m oldRank0))} is VALID [2020-07-29 01:27:50,850 INFO L280 TraceCheckUtils]: 1: Hoare triple {54#(<= 0 (+ mult_~m oldRank0))} assume ~m < 0; {58#(and (<= 0 (+ mult_~m oldRank0)) (< mult_~m 0))} is VALID [2020-07-29 01:27:50,856 INFO L263 TraceCheckUtils]: 2: Hoare triple {58#(and (<= 0 (+ mult_~m oldRank0)) (< mult_~m 0))} call #t~ret0 := mult(~n, -~m); {40#(or (and (> oldRank0 (* (- 1) |mult_#in~m|)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:27:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:50,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:27:50,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:50,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:50,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,908 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-07-29 01:27:50,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2020-07-29 01:27:51,181 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 46 states and 59 transitions. Complement of second has 12 states. [2020-07-29 01:27:51,182 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-07-29 01:27:51,183 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:51,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 01:27:51,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:27:51,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:51,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:51,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:27:51,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:51,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:51,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:51,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 59 transitions. [2020-07-29 01:27:51,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:27:51,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:51,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:51,214 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states. [2020-07-29 01:27:51,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:27:51,224 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:27:51,224 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:27:51,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:51,235 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:51,235 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 59 transitions. cyclomatic complexity: 15 [2020-07-29 01:27:51,238 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:27:51,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:51,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:51,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:51,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:27:51,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:27:51,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:27:51,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:27:51,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:27:51,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:27:51,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:51,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:51,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:51,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:51,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:51,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:51,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:27:51,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:27:51,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:27:51,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:27:51,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:27:51,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:27:51,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:51,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:51,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:51,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:27:51,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:27:51,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:27:51,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:51,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:51,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:51,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:27:51,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:27:51,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:27:51,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:27:51,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:27:51,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:27:51,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:51,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:51,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 59 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:51,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,281 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:27:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 01:27:51,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:51,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:27:51,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 59 transitions. cyclomatic complexity: 15 [2020-07-29 01:27:51,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:27:51,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 21 states and 24 transitions. [2020-07-29 01:27:51,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:27:51,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:27:51,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2020-07-29 01:27:51,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:51,322 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-07-29 01:27:51,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2020-07-29 01:27:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2020-07-29 01:27:51,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:51,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 24 transitions. Second operand 14 states. [2020-07-29 01:27:51,355 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 24 transitions. Second operand 14 states. [2020-07-29 01:27:51,358 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 14 states. [2020-07-29 01:27:51,363 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:51,371 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-07-29 01:27:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2020-07-29 01:27:51,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:51,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:51,374 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 21 states and 24 transitions. [2020-07-29 01:27:51,375 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 21 states and 24 transitions. [2020-07-29 01:27:51,376 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:51,390 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-29 01:27:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-29 01:27:51,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:51,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:51,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:51,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:27:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-07-29 01:27:51,399 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-07-29 01:27:51,399 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-07-29 01:27:51,399 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:27:51,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2020-07-29 01:27:51,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:27:51,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:51,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:51,401 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:27:51,401 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:27:51,401 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~res~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 131#L26 assume !!(-65535 <= main_~m~0 && main_~m~0 <= 65535); 132#L27 assume !!(-65535 <= main_~n~0 && main_~n~0 <= 65535); 126#L28 call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 125#multENTRY ~n := #in~n;~m := #in~m; 128#L13 assume !(~m < 0); 133#L16 [2020-07-29 01:27:51,402 INFO L796 eck$LassoCheckResult]: Loop: 133#L16 assume !(0 == ~m); 134#L19 call #t~ret1 := mult(~n, ~m - 1);< 137#multENTRY ~n := #in~n;~m := #in~m; 138#L13 assume !(~m < 0); 133#L16 [2020-07-29 01:27:51,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:51,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1336189782, now seen corresponding path program 1 times [2020-07-29 01:27:51,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:51,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817364233] [2020-07-29 01:27:51,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:51,424 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:51,445 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:51,451 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:51,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:51,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1253150, now seen corresponding path program 1 times [2020-07-29 01:27:51,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:51,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744605665] [2020-07-29 01:27:51,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:51,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:51,462 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:51,463 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:51,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:51,464 INFO L82 PathProgramCache]: Analyzing trace with hash -614723597, now seen corresponding path program 1 times [2020-07-29 01:27:51,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:51,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361675903] [2020-07-29 01:27:51,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:51,474 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:51,481 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:51,484 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:51,585 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:51,585 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:51,585 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:51,585 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:51,585 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:27:51,586 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:51,586 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:51,586 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:51,586 INFO L133 ssoRankerPreferences]: Filename of dumped script: RecursiveMultiplication-1.c_Iteration2_Loop [2020-07-29 01:27:51,586 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:51,586 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:51,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:51,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:51,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:51,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:51,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:51,807 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:51,807 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:51,813 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:51,813 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:51,816 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:51,817 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-07-29 01:27:51,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:51,842 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:51,851 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:51,851 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:51,905 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:51,905 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:51,908 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:51,909 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-07-29 01:27:51,949 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:51,949 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) [2020-07-29 01:27:51,979 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:27:51,979 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:53,034 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:27:53,036 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:53,036 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:53,036 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:53,036 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:53,036 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:27:53,036 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:53,036 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:53,036 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:53,036 INFO L133 ssoRankerPreferences]: Filename of dumped script: RecursiveMultiplication-1.c_Iteration2_Loop [2020-07-29 01:27:53,037 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:53,037 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:53,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:53,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:53,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:53,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:53,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:53,213 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:53,213 INFO L489 LassoAnalysis]: Using template 'affine'. 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-07-29 01:27:53,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:53,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:53,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:53,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:53,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:53,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:53,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:53,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:53,223 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-07-29 01:27:53,260 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-07-29 01:27:53,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:53,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:53,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:53,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:53,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:53,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:53,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:53,267 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-07-29 01:27:53,305 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-07-29 01:27:53,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:53,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:53,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:53,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:53,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:53,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:53,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:53,312 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-07-29 01:27:53,336 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-07-29 01:27:53,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:53,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:53,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:53,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:53,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:53,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:53,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:53,343 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:27:53,346 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:27:53,346 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 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-07-29 01:27:53,353 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:27:53,353 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:27:53,353 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:27:53,354 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2020-07-29 01:27:53,382 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:27:53,384 INFO L393 LassoCheck]: Loop: "assume !(0 == ~m);" "call #t~ret1 := mult(~n, ~m - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" [2020-07-29 01:27:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:53,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:53,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:27:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:53,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:53,469 INFO L280 TraceCheckUtils]: 0: Hoare triple {293#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~res~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {293#unseeded} is VALID [2020-07-29 01:27:53,472 INFO L280 TraceCheckUtils]: 1: Hoare triple {293#unseeded} assume !!(-65535 <= main_~m~0 && main_~m~0 <= 65535); {293#unseeded} is VALID [2020-07-29 01:27:53,473 INFO L280 TraceCheckUtils]: 2: Hoare triple {293#unseeded} assume !!(-65535 <= main_~n~0 && main_~n~0 <= 65535); {293#unseeded} is VALID [2020-07-29 01:27:53,474 INFO L263 TraceCheckUtils]: 3: Hoare triple {293#unseeded} call main_#t~ret4 := mult(main_~m~0, main_~n~0); {293#unseeded} is VALID [2020-07-29 01:27:53,475 INFO L280 TraceCheckUtils]: 4: Hoare triple {293#unseeded} ~n := #in~n;~m := #in~m; {293#unseeded} is VALID [2020-07-29 01:27:53,476 INFO L280 TraceCheckUtils]: 5: Hoare triple {293#unseeded} assume !(~m < 0); {293#unseeded} is VALID [2020-07-29 01:27:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:53,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:27:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:53,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:53,676 INFO L280 TraceCheckUtils]: 0: Hoare triple {296#(>= oldRank0 mult_~m)} assume !(0 == ~m); {296#(>= oldRank0 mult_~m)} is VALID [2020-07-29 01:27:53,678 INFO L263 TraceCheckUtils]: 1: Hoare triple {296#(>= oldRank0 mult_~m)} call #t~ret1 := mult(~n, ~m - 1); {329#(<= (+ |mult_#in~m| 1) oldRank0)} is VALID [2020-07-29 01:27:53,680 INFO L280 TraceCheckUtils]: 2: Hoare triple {329#(<= (+ |mult_#in~m| 1) oldRank0)} ~n := #in~n;~m := #in~m; {333#(<= (+ mult_~m 1) oldRank0)} is VALID [2020-07-29 01:27:53,681 INFO L280 TraceCheckUtils]: 3: Hoare triple {333#(<= (+ mult_~m 1) oldRank0)} assume !(~m < 0); {306#(or unseeded (and (> oldRank0 mult_~m) (>= oldRank0 0)))} is VALID [2020-07-29 01:27:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:53,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:27:53,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:53,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:27:53,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,695 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-07-29 01:27:53,695 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 5 states. [2020-07-29 01:27:53,781 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 26 states and 31 transitions. Complement of second has 13 states. [2020-07-29 01:27:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:53,781 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:53,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:27:53,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:53,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:53,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:27:53,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:27:53,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:53,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:53,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2020-07-29 01:27:53,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:27:53,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:53,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:53,786 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:27:53,788 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:27:53,788 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:27:53,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:27:53,789 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:53,790 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 31 transitions. cyclomatic complexity: 8 [2020-07-29 01:27:53,791 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:27:53,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:27:53,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:27:53,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:27:53,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:27:53,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:27:53,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:27:53,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:27:53,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:27:53,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:27:53,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:27:53,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:27:53,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:27:53,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:27:53,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:27:53,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:27:53,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:53,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:53,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:53,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:27:53,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:27:53,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:27:53,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:27:53,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:27:53,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:27:53,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:53,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:53,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:53,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:53,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:53,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:53,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:53,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:53,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:53,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:27:53,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:27:53,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:27:53,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:27:53,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:27:53,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:27:53,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:27:53,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:27:53,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:27:53,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:53,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:53,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:53,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:27:53,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:27:53,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:27:53,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:27:53,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:27:53,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:27:53,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,816 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:27:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-07-29 01:27:53,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:27:53,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:27:53,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:27:53,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:53,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. cyclomatic complexity: 8 [2020-07-29 01:27:53,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:27:53,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 30 transitions. [2020-07-29 01:27:53,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 01:27:53,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:27:53,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2020-07-29 01:27:53,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:53,825 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2020-07-29 01:27:53,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2020-07-29 01:27:53,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2020-07-29 01:27:53,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:53,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 30 transitions. Second operand 22 states. [2020-07-29 01:27:53,828 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 30 transitions. Second operand 22 states. [2020-07-29 01:27:53,829 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 22 states. [2020-07-29 01:27:53,829 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:53,832 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-29 01:27:53,833 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-29 01:27:53,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:53,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:53,834 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 25 states and 30 transitions. [2020-07-29 01:27:53,834 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 25 states and 30 transitions. [2020-07-29 01:27:53,835 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:53,840 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2020-07-29 01:27:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2020-07-29 01:27:53,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:53,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:53,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:53,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:27:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-07-29 01:27:53,844 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-07-29 01:27:53,844 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-07-29 01:27:53,844 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:27:53,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-07-29 01:27:53,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:27:53,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:53,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:53,846 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:27:53,846 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:53,846 INFO L794 eck$LassoCheckResult]: Stem: 389#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~res~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 381#L26 assume !!(-65535 <= main_~m~0 && main_~m~0 <= 65535); 382#L27 assume !!(-65535 <= main_~n~0 && main_~n~0 <= 65535); 394#L28 call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 395#multENTRY ~n := #in~n;~m := #in~m; 400#L13 assume !(~m < 0); 401#L16 assume !(0 == ~m); 384#L19 call #t~ret1 := mult(~n, ~m - 1);< 383#multENTRY ~n := #in~n;~m := #in~m; 385#L13 assume ~m < 0; 392#L14 [2020-07-29 01:27:53,846 INFO L796 eck$LassoCheckResult]: Loop: 392#L14 call #t~ret0 := mult(~n, -~m);< 396#multENTRY ~n := #in~n;~m := #in~m; 402#L13 assume ~m < 0; 392#L14 [2020-07-29 01:27:53,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:53,847 INFO L82 PathProgramCache]: Analyzing trace with hash -614723600, now seen corresponding path program 1 times [2020-07-29 01:27:53,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:53,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47591158] [2020-07-29 01:27:53,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:53,954 INFO L280 TraceCheckUtils]: 0: Hoare triple {573#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~res~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {573#true} is VALID [2020-07-29 01:27:53,955 INFO L280 TraceCheckUtils]: 1: Hoare triple {573#true} assume !!(-65535 <= main_~m~0 && main_~m~0 <= 65535); {573#true} is VALID [2020-07-29 01:27:53,955 INFO L280 TraceCheckUtils]: 2: Hoare triple {573#true} assume !!(-65535 <= main_~n~0 && main_~n~0 <= 65535); {573#true} is VALID [2020-07-29 01:27:53,955 INFO L263 TraceCheckUtils]: 3: Hoare triple {573#true} call main_#t~ret4 := mult(main_~m~0, main_~n~0); {573#true} is VALID [2020-07-29 01:27:53,955 INFO L280 TraceCheckUtils]: 4: Hoare triple {573#true} ~n := #in~n;~m := #in~m; {573#true} is VALID [2020-07-29 01:27:53,956 INFO L280 TraceCheckUtils]: 5: Hoare triple {573#true} assume !(~m < 0); {575#(< 0 (+ mult_~m 1))} is VALID [2020-07-29 01:27:53,957 INFO L280 TraceCheckUtils]: 6: Hoare triple {575#(< 0 (+ mult_~m 1))} assume !(0 == ~m); {576#(< 0 mult_~m)} is VALID [2020-07-29 01:27:53,959 INFO L263 TraceCheckUtils]: 7: Hoare triple {576#(< 0 mult_~m)} call #t~ret1 := mult(~n, ~m - 1); {577#(<= 0 |mult_#in~m|)} is VALID [2020-07-29 01:27:53,960 INFO L280 TraceCheckUtils]: 8: Hoare triple {577#(<= 0 |mult_#in~m|)} ~n := #in~n;~m := #in~m; {575#(< 0 (+ mult_~m 1))} is VALID [2020-07-29 01:27:53,961 INFO L280 TraceCheckUtils]: 9: Hoare triple {575#(< 0 (+ mult_~m 1))} assume ~m < 0; {574#false} is VALID [2020-07-29 01:27:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:53,963 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47591158] [2020-07-29 01:27:53,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:27:53,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:27:53,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138918006] [2020-07-29 01:27:53,969 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:53,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:53,969 INFO L82 PathProgramCache]: Analyzing trace with hash 59585, now seen corresponding path program 2 times [2020-07-29 01:27:53,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:53,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838198519] [2020-07-29 01:27:53,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:53,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:53,989 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:53,992 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:54,072 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:54,072 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:54,072 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:54,072 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:54,072 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:27:54,072 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:54,073 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:54,073 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:54,073 INFO L133 ssoRankerPreferences]: Filename of dumped script: RecursiveMultiplication-1.c_Iteration3_Loop [2020-07-29 01:27:54,073 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:54,073 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:54,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:54,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:54,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:54,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:54,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:54,241 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:54,241 INFO L404 LassoAnalysis]: Checking for nontermination... 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-07-29 01:27:54,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:54,248 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:54,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:27:54,286 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:55,497 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:27:55,499 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:55,499 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:55,499 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:55,499 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:55,499 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:27:55,499 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:55,499 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:55,500 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:55,500 INFO L133 ssoRankerPreferences]: Filename of dumped script: RecursiveMultiplication-1.c_Iteration3_Loop [2020-07-29 01:27:55,500 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:55,500 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:55,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:55,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-07-29 01:27:55,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:55,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:55,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:55,649 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:55,650 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:55,658 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-07-29 01:27:55,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:55,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:55,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:55,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:55,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:55,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:55,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:55,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:55,691 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-07-29 01:27:55,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:55,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:55,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:55,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:55,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:55,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:55,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:55,697 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:27:55,701 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:27:55,701 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:55,704 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:27:55,704 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:27:55,704 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:27:55,704 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2020-07-29 01:27:55,726 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:27:55,728 INFO L393 LassoCheck]: Loop: "call #t~ret0 := mult(~n, -~m);"< "~n := #in~n;~m := #in~m;" "assume ~m < 0;" [2020-07-29 01:27:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:55,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:55,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:27:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:55,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:55,795 INFO L280 TraceCheckUtils]: 0: Hoare triple {580#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~res~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {580#unseeded} is VALID [2020-07-29 01:27:55,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {580#unseeded} assume !!(-65535 <= main_~m~0 && main_~m~0 <= 65535); {580#unseeded} is VALID [2020-07-29 01:27:55,796 INFO L280 TraceCheckUtils]: 2: Hoare triple {580#unseeded} assume !!(-65535 <= main_~n~0 && main_~n~0 <= 65535); {580#unseeded} is VALID [2020-07-29 01:27:55,797 INFO L263 TraceCheckUtils]: 3: Hoare triple {580#unseeded} call main_#t~ret4 := mult(main_~m~0, main_~n~0); {580#unseeded} is VALID [2020-07-29 01:27:55,798 INFO L280 TraceCheckUtils]: 4: Hoare triple {580#unseeded} ~n := #in~n;~m := #in~m; {580#unseeded} is VALID [2020-07-29 01:27:55,798 INFO L280 TraceCheckUtils]: 5: Hoare triple {580#unseeded} assume !(~m < 0); {580#unseeded} is VALID [2020-07-29 01:27:55,799 INFO L280 TraceCheckUtils]: 6: Hoare triple {580#unseeded} assume !(0 == ~m); {580#unseeded} is VALID [2020-07-29 01:27:55,800 INFO L263 TraceCheckUtils]: 7: Hoare triple {580#unseeded} call #t~ret1 := mult(~n, ~m - 1); {580#unseeded} is VALID [2020-07-29 01:27:55,801 INFO L280 TraceCheckUtils]: 8: Hoare triple {580#unseeded} ~n := #in~n;~m := #in~m; {580#unseeded} is VALID [2020-07-29 01:27:55,801 INFO L280 TraceCheckUtils]: 9: Hoare triple {580#unseeded} assume ~m < 0; {580#unseeded} is VALID [2020-07-29 01:27:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:55,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:27:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:55,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:55,946 INFO L263 TraceCheckUtils]: 0: Hoare triple {583#(>= oldRank0 mult_~m)} call #t~ret0 := mult(~n, -~m); {625#(<= 0 (+ oldRank0 |mult_#in~m|))} is VALID [2020-07-29 01:27:55,947 INFO L280 TraceCheckUtils]: 1: Hoare triple {625#(<= 0 (+ oldRank0 |mult_#in~m|))} ~n := #in~n;~m := #in~m; {629#(<= 0 (+ mult_~m oldRank0))} is VALID [2020-07-29 01:27:55,951 INFO L280 TraceCheckUtils]: 2: Hoare triple {629#(<= 0 (+ mult_~m oldRank0))} assume ~m < 0; {593#(or unseeded (and (> oldRank0 mult_~m) (>= oldRank0 0)))} is VALID [2020-07-29 01:27:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:55,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:27:55,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:55,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:55,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:55,968 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-07-29 01:27:55,969 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-07-29 01:27:56,055 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 51 states and 61 transitions. Complement of second has 9 states. [2020-07-29 01:27:56,056 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-07-29 01:27:56,056 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:56,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. cyclomatic complexity: 8 [2020-07-29 01:27:56,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:56,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:56,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:27:56,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:56,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:56,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:56,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 61 transitions. [2020-07-29 01:27:56,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:27:56,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:56,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:56,061 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 27 transitions. cyclomatic complexity: 8 [2020-07-29 01:27:56,062 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:27:56,062 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:27:56,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:56,063 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:56,063 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 51 states and 61 transitions. cyclomatic complexity: 15 [2020-07-29 01:27:56,065 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:27:56,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:56,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:56,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:56,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:56,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:56,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:56,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:56,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:56,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:56,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 51 letters. Loop has 51 letters. [2020-07-29 01:27:56,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 51 letters. Loop has 51 letters. [2020-07-29 01:27:56,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 51 letters. Loop has 51 letters. [2020-07-29 01:27:56,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:27:56,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:27:56,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:27:56,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:56,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:56,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:56,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:27:56,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:27:56,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:27:56,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:27:56,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:27:56,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:27:56,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:27:56,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:27:56,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:27:56,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:56,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:56,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:56,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:27:56,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:27:56,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:27:56,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:56,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:56,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:56,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:27:56,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:27:56,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:27:56,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:27:56,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:27:56,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:27:56,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:27:56,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:27:56,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:27:56,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:27:56,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:27:56,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:27:56,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:56,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:56,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:56,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,086 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:56,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:27:56,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:27:56,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:56,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:56,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:27:56,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:56,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 61 transitions. cyclomatic complexity: 15 [2020-07-29 01:27:56,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:27:56,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 44 states and 54 transitions. [2020-07-29 01:27:56,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-07-29 01:27:56,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-07-29 01:27:56,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 54 transitions. [2020-07-29 01:27:56,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:56,097 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2020-07-29 01:27:56,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 54 transitions. [2020-07-29 01:27:56,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2020-07-29 01:27:56,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:56,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states and 54 transitions. Second operand 38 states. [2020-07-29 01:27:56,101 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states and 54 transitions. Second operand 38 states. [2020-07-29 01:27:56,101 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 38 states. [2020-07-29 01:27:56,102 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:56,107 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2020-07-29 01:27:56,107 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2020-07-29 01:27:56,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:56,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:56,109 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 44 states and 54 transitions. [2020-07-29 01:27:56,109 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 44 states and 54 transitions. [2020-07-29 01:27:56,110 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:56,116 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2020-07-29 01:27:56,116 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2020-07-29 01:27:56,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:56,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:56,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:56,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-29 01:27:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2020-07-29 01:27:56,121 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2020-07-29 01:27:56,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:56,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:27:56,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:27:56,125 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand 5 states. [2020-07-29 01:27:56,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:56,221 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-29 01:27:56,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:27:56,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:27:56,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:56,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2020-07-29 01:27:56,235 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:27:56,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2020-07-29 01:27:56,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:27:56,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:27:56,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:27:56,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:56,237 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:27:56,237 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:27:56,237 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:27:56,237 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:27:56,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:27:56,237 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:27:56,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:27:56,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:27:56 BoogieIcfgContainer [2020-07-29 01:27:56,245 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:27:56,245 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:27:56,246 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:27:56,246 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:27:56,247 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:27:48" (3/4) ... [2020-07-29 01:27:56,250 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:27:56,251 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:27:56,254 INFO L168 Benchmark]: Toolchain (without parser) took 8286.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 957.5 MB in the beginning and 873.3 MB in the end (delta: 84.2 MB). Peak memory consumption was 298.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:56,254 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:27:56,255 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.90 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:56,256 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.12 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:27:56,257 INFO L168 Benchmark]: Boogie Preprocessor took 77.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -190.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:56,257 INFO L168 Benchmark]: RCFGBuilder took 364.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:56,258 INFO L168 Benchmark]: BuchiAutomizer took 7572.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 873.3 MB in the end (delta: 243.9 MB). Peak memory consumption was 310.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:56,259 INFO L168 Benchmark]: Witness Printer took 5.29 ms. Allocated memory is still 1.2 GB. Free memory is still 873.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:27:56,262 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 223.90 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.12 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -190.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 364.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7572.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 873.3 MB in the end (delta: 243.9 MB). Peak memory consumption was 310.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.29 ms. Allocated memory is still 1.2 GB. Free memory is still 873.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * \old(m) and consists of 4 locations. One deterministic module has affine ranking function m and consists of 5 locations. One deterministic module has affine ranking function m and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 5.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 42 SDtfs, 48 SDslu, 19 SDs, 0 SdLazy, 73 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf102 lsp71 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq171 hnf92 smp100 dnf100 smp100 tf110 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...