./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.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 31d0c4253184c01eb9f9573658b07bed7aa94585 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:57:40,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:57:40,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:57:40,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:57:40,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:57:40,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:57:40,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:57:40,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:57:40,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:57:40,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:57:40,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:57:40,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:57:40,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:57:40,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:57:40,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:57:40,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:57:40,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:57:40,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:57:40,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:57:40,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:57:40,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:57:40,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:57:40,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:57:40,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:57:40,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:57:40,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:57:40,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:57:40,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:57:40,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:57:40,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:57:40,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:57:40,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:57:40,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:57:40,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:57:40,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:57:40,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:57:40,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:57:40,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:57:40,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:57:40,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:57:40,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:57:40,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 02:57:40,234 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:57:40,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:57:40,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:57:40,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:57:40,236 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:57:40,236 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 02:57:40,237 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 02:57:40,237 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 02:57:40,237 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 02:57:40,237 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 02:57:40,238 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 02:57:40,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:57:40,238 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:57:40,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:57:40,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:57:40,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 02:57:40,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 02:57:40,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 02:57:40,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:57:40,240 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 02:57:40,240 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:57:40,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 02:57:40,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:57:40,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:57:40,241 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 02:57:40,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:57:40,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:57:40,242 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 02:57:40,243 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 02:57:40,243 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 -> 31d0c4253184c01eb9f9573658b07bed7aa94585 [2019-11-28 02:57:40,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:57:40,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:57:40,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:57:40,579 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:57:40,580 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:57:40,581 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c [2019-11-28 02:57:40,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae7f7333c/941db35277b24dd4a428d649db91a822/FLAGaf724430f [2019-11-28 02:57:41,153 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:57:41,154 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c [2019-11-28 02:57:41,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae7f7333c/941db35277b24dd4a428d649db91a822/FLAGaf724430f [2019-11-28 02:57:41,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae7f7333c/941db35277b24dd4a428d649db91a822 [2019-11-28 02:57:41,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:57:41,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:57:41,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:57:41,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:57:41,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:57:41,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:57:41" (1/1) ... [2019-11-28 02:57:41,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cd5d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:41, skipping insertion in model container [2019-11-28 02:57:41,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:57:41" (1/1) ... [2019-11-28 02:57:41,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:57:41,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:57:41,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:57:41,768 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:57:41,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:57:41,792 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:57:41,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:41 WrapperNode [2019-11-28 02:57:41,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:57:41,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:57:41,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:57:41,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:57:41,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:41" (1/1) ... [2019-11-28 02:57:41,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:41" (1/1) ... [2019-11-28 02:57:41,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:57:41,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:57:41,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:57:41,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:57:41,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:41" (1/1) ... [2019-11-28 02:57:41,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:41" (1/1) ... [2019-11-28 02:57:41,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:41" (1/1) ... [2019-11-28 02:57:41,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:41" (1/1) ... [2019-11-28 02:57:41,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:41" (1/1) ... [2019-11-28 02:57:41,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:41" (1/1) ... [2019-11-28 02:57:41,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:41" (1/1) ... [2019-11-28 02:57:41,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:57:41,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:57:41,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:57:41,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:57:41,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:57:41,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:57:42,118 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:57:42,119 INFO L297 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 02:57:42,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:57:42 BoogieIcfgContainer [2019-11-28 02:57:42,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:57:42,120 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 02:57:42,120 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 02:57:42,123 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 02:57:42,124 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:57:42,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 02:57:41" (1/3) ... [2019-11-28 02:57:42,125 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36bb8a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:57:42, skipping insertion in model container [2019-11-28 02:57:42,125 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:57:42,125 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:41" (2/3) ... [2019-11-28 02:57:42,126 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36bb8a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:57:42, skipping insertion in model container [2019-11-28 02:57:42,126 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:57:42,126 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:57:42" (3/3) ... [2019-11-28 02:57:42,128 INFO L371 chiAutomizerObserver]: Analyzing ICFG Urban-WST2013-Fig2.c [2019-11-28 02:57:42,175 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 02:57:42,175 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 02:57:42,175 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 02:57:42,175 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:57:42,175 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:57:42,175 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 02:57:42,175 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:57:42,176 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 02:57:42,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-11-28 02:57:42,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:57:42,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:42,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:42,217 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:57:42,217 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:57:42,218 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 02:57:42,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-11-28 02:57:42,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:57:42,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:42,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:42,219 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:57:42,220 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:57:42,226 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 6#L19-2true [2019-11-28 02:57:42,226 INFO L796 eck$LassoCheckResult]: Loop: 6#L19-2true assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 9#L21-2true assume !(main_~x2~0 > 1); 8#L21-3true main_~x1~0 := 1 + main_~x1~0; 6#L19-2true [2019-11-28 02:57:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:42,231 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 02:57:42,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:42,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251801133] [2019-11-28 02:57:42,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:42,319 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:42,320 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-11-28 02:57:42,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:42,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594887727] [2019-11-28 02:57:42,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:42,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594887727] [2019-11-28 02:57:42,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:57:42,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:57:42,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003802803] [2019-11-28 02:57:42,417 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:57:42,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:57:42,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:57:42,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:57:42,470 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-11-28 02:57:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:57:42,519 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-11-28 02:57:42,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:57:42,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-11-28 02:57:42,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:57:42,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 5 states and 6 transitions. [2019-11-28 02:57:42,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-28 02:57:42,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-11-28 02:57:42,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2019-11-28 02:57:42,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:57:42,529 INFO L688 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-11-28 02:57:42,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2019-11-28 02:57:42,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-11-28 02:57:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:57:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-11-28 02:57:42,558 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-11-28 02:57:42,558 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-11-28 02:57:42,559 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 02:57:42,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2019-11-28 02:57:42,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:57:42,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:42,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:42,560 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:57:42,560 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:57:42,560 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 27#L19-2 [2019-11-28 02:57:42,561 INFO L796 eck$LassoCheckResult]: Loop: 27#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 28#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 30#L21-2 assume !(main_~x2~0 > 1); 29#L21-3 main_~x1~0 := 1 + main_~x1~0; 27#L19-2 [2019-11-28 02:57:42,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:42,561 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 02:57:42,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:42,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973601126] [2019-11-28 02:57:42,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:42,573 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:42,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:42,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1240240, now seen corresponding path program 1 times [2019-11-28 02:57:42,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:42,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254116117] [2019-11-28 02:57:42,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:42,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254116117] [2019-11-28 02:57:42,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611171133] [2019-11-28 02:57:42,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:57:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:42,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:57:42,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:42,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:42,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:57:42,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-28 02:57:42,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291310440] [2019-11-28 02:57:42,698 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:57:42,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:57:42,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:57:42,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:57:42,699 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-11-28 02:57:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:57:42,721 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2019-11-28 02:57:42,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:57:42,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 7 transitions. [2019-11-28 02:57:42,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 02:57:42,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 7 transitions. [2019-11-28 02:57:42,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 02:57:42,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-28 02:57:42,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2019-11-28 02:57:42,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:57:42,725 INFO L688 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-28 02:57:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2019-11-28 02:57:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-11-28 02:57:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 02:57:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-11-28 02:57:42,726 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-28 02:57:42,727 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-28 02:57:42,727 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 02:57:42,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-11-28 02:57:42,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 02:57:42,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:42,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:42,728 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:57:42,728 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1] [2019-11-28 02:57:42,728 INFO L794 eck$LassoCheckResult]: Stem: 53#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 54#L19-2 [2019-11-28 02:57:42,729 INFO L796 eck$LassoCheckResult]: Loop: 54#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 55#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 57#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 58#L21-2 assume !(main_~x2~0 > 1); 56#L21-3 main_~x1~0 := 1 + main_~x1~0; 54#L19-2 [2019-11-28 02:57:42,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:42,729 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-28 02:57:42,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:42,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931774592] [2019-11-28 02:57:42,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:42,736 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:42,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash 38449199, now seen corresponding path program 2 times [2019-11-28 02:57:42,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:42,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910621517] [2019-11-28 02:57:42,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:42,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910621517] [2019-11-28 02:57:42,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142251799] [2019-11-28 02:57:42,772 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:57:42,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:57:42,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:57:42,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:57:42,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:42,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:57:42,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 02:57:42,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104377731] [2019-11-28 02:57:42,804 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:57:42,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:57:42,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:57:42,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:57:42,805 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-11-28 02:57:42,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:57:42,824 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-11-28 02:57:42,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:57:42,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2019-11-28 02:57:42,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 02:57:42,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2019-11-28 02:57:42,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 02:57:42,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 02:57:42,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-11-28 02:57:42,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:57:42,826 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-28 02:57:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-11-28 02:57:42,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-28 02:57:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:57:42,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-11-28 02:57:42,828 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-28 02:57:42,828 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-28 02:57:42,828 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 02:57:42,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-11-28 02:57:42,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 02:57:42,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:42,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:42,830 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:57:42,831 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 1, 1, 1] [2019-11-28 02:57:42,831 INFO L794 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 87#L19-2 [2019-11-28 02:57:42,832 INFO L796 eck$LassoCheckResult]: Loop: 87#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 88#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 90#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 92#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 91#L21-2 assume !(main_~x2~0 > 1); 89#L21-3 main_~x1~0 := 1 + main_~x1~0; 87#L19-2 [2019-11-28 02:57:42,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:42,832 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-28 02:57:42,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:42,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542256859] [2019-11-28 02:57:42,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:42,843 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:42,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:42,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1191926928, now seen corresponding path program 3 times [2019-11-28 02:57:42,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:42,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730953856] [2019-11-28 02:57:42,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:42,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730953856] [2019-11-28 02:57:42,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022483981] [2019-11-28 02:57:42,925 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:57:42,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 02:57:42,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:57:42,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:57:42,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:42,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:57:42,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 02:57:42,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903947876] [2019-11-28 02:57:42,975 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:57:42,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:57:42,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:57:42,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:57:42,976 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-11-28 02:57:42,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:57:42,994 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-11-28 02:57:42,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:57:42,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2019-11-28 02:57:42,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 02:57:42,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2019-11-28 02:57:42,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 02:57:42,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 02:57:42,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2019-11-28 02:57:42,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:57:42,997 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 02:57:42,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2019-11-28 02:57:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-28 02:57:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:57:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-11-28 02:57:42,999 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 02:57:42,999 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 02:57:42,999 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 02:57:42,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2019-11-28 02:57:42,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 02:57:42,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:43,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:43,000 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:57:43,000 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 1, 1, 1] [2019-11-28 02:57:43,000 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 126#L19-2 [2019-11-28 02:57:43,001 INFO L796 eck$LassoCheckResult]: Loop: 126#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 127#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 129#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 132#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 131#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 130#L21-2 assume !(main_~x2~0 > 1); 128#L21-3 main_~x1~0 := 1 + main_~x1~0; 126#L19-2 [2019-11-28 02:57:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:43,001 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-28 02:57:43,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:43,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021160651] [2019-11-28 02:57:43,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:43,007 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:43,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:43,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1704969137, now seen corresponding path program 4 times [2019-11-28 02:57:43,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:43,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264832415] [2019-11-28 02:57:43,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:43,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264832415] [2019-11-28 02:57:43,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266449302] [2019-11-28 02:57:43,084 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:57:43,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:57:43,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:57:43,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:57:43,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:57:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:43,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:57:43,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 02:57:43,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138410848] [2019-11-28 02:57:43,138 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:57:43,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:57:43,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:57:43,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:57:43,139 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 7 states. [2019-11-28 02:57:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:57:43,171 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-11-28 02:57:43,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:57:43,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-11-28 02:57:43,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 02:57:43,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2019-11-28 02:57:43,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 02:57:43,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 02:57:43,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2019-11-28 02:57:43,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:57:43,174 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-28 02:57:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2019-11-28 02:57:43,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-28 02:57:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:57:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-28 02:57:43,179 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-28 02:57:43,179 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-28 02:57:43,179 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 02:57:43,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-28 02:57:43,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 02:57:43,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:43,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:43,181 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:57:43,181 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 1, 1, 1] [2019-11-28 02:57:43,181 INFO L794 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 171#L19-2 [2019-11-28 02:57:43,182 INFO L796 eck$LassoCheckResult]: Loop: 171#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 172#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 174#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 178#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 177#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 176#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 175#L21-2 assume !(main_~x2~0 > 1); 173#L21-3 main_~x1~0 := 1 + main_~x1~0; 171#L19-2 [2019-11-28 02:57:43,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:43,182 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-28 02:57:43,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:43,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205748238] [2019-11-28 02:57:43,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:43,196 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:43,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:43,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1314433936, now seen corresponding path program 5 times [2019-11-28 02:57:43,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:43,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979157052] [2019-11-28 02:57:43,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:43,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979157052] [2019-11-28 02:57:43,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752385808] [2019-11-28 02:57:43,294 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:57:43,332 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-28 02:57:43,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:57:43,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:57:43,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:43,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:57:43,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 02:57:43,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820181865] [2019-11-28 02:57:43,344 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:57:43,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:57:43,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:57:43,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:57:43,345 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 8 states. [2019-11-28 02:57:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:57:43,376 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-11-28 02:57:43,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:57:43,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-11-28 02:57:43,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 02:57:43,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-11-28 02:57:43,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 02:57:43,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 02:57:43,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-11-28 02:57:43,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:57:43,380 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 02:57:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-11-28 02:57:43,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-28 02:57:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 02:57:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-11-28 02:57:43,382 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 02:57:43,382 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 02:57:43,383 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 02:57:43,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2019-11-28 02:57:43,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 02:57:43,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:43,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:43,385 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:57:43,385 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 1, 1, 1] [2019-11-28 02:57:43,385 INFO L794 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 222#L19-2 [2019-11-28 02:57:43,386 INFO L796 eck$LassoCheckResult]: Loop: 222#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 223#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 225#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 230#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 229#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 228#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 227#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 226#L21-2 assume !(main_~x2~0 > 1); 224#L21-3 main_~x1~0 := 1 + main_~x1~0; 222#L19-2 [2019-11-28 02:57:43,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:43,386 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-28 02:57:43,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:43,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744843249] [2019-11-28 02:57:43,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:43,393 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:43,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:43,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2092744593, now seen corresponding path program 6 times [2019-11-28 02:57:43,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:43,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209346745] [2019-11-28 02:57:43,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:43,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209346745] [2019-11-28 02:57:43,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185705540] [2019-11-28 02:57:43,480 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:57:43,507 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-28 02:57:43,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:57:43,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:57:43,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:43,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:57:43,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-28 02:57:43,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139916775] [2019-11-28 02:57:43,524 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:57:43,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:57:43,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:57:43,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:57:43,527 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 9 states. [2019-11-28 02:57:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:57:43,556 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-11-28 02:57:43,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:57:43,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-11-28 02:57:43,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 02:57:43,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2019-11-28 02:57:43,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 02:57:43,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 02:57:43,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2019-11-28 02:57:43,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:57:43,559 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-28 02:57:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2019-11-28 02:57:43,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-28 02:57:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 02:57:43,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-11-28 02:57:43,562 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-28 02:57:43,562 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-28 02:57:43,562 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 02:57:43,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-11-28 02:57:43,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 02:57:43,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:43,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:43,564 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:57:43,564 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 1, 1, 1] [2019-11-28 02:57:43,564 INFO L794 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 279#L19-2 [2019-11-28 02:57:43,564 INFO L796 eck$LassoCheckResult]: Loop: 279#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 280#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 282#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 288#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 287#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 286#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 285#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 284#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 283#L21-2 assume !(main_~x2~0 > 1); 281#L21-3 main_~x1~0 := 1 + main_~x1~0; 279#L19-2 [2019-11-28 02:57:43,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:43,565 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-11-28 02:57:43,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:43,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189540594] [2019-11-28 02:57:43,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:43,571 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:43,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:43,572 INFO L82 PathProgramCache]: Analyzing trace with hash -450571184, now seen corresponding path program 7 times [2019-11-28 02:57:43,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:43,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331565471] [2019-11-28 02:57:43,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:43,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331565471] [2019-11-28 02:57:43,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488646076] [2019-11-28 02:57:43,674 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:57:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:43,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:57:43,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:43,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:57:43,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-28 02:57:43,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502300767] [2019-11-28 02:57:43,709 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:57:43,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:57:43,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:57:43,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:57:43,710 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 10 states. [2019-11-28 02:57:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:57:43,737 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-11-28 02:57:43,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:57:43,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-11-28 02:57:43,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-28 02:57:43,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2019-11-28 02:57:43,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 02:57:43,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 02:57:43,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-11-28 02:57:43,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:57:43,740 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-28 02:57:43,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-11-28 02:57:43,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-28 02:57:43,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 02:57:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-11-28 02:57:43,742 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-28 02:57:43,742 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-28 02:57:43,742 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 02:57:43,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-11-28 02:57:43,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-28 02:57:43,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:43,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:43,744 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:57:43,744 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 1, 1, 1] [2019-11-28 02:57:43,744 INFO L794 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 342#L19-2 [2019-11-28 02:57:43,744 INFO L796 eck$LassoCheckResult]: Loop: 342#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 343#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 345#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 352#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 351#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 350#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 349#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 348#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 347#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 346#L21-2 assume !(main_~x2~0 > 1); 344#L21-3 main_~x1~0 := 1 + main_~x1~0; 342#L19-2 [2019-11-28 02:57:43,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:43,745 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-11-28 02:57:43,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:43,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007725355] [2019-11-28 02:57:43,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:43,750 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:43,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:43,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1082803057, now seen corresponding path program 8 times [2019-11-28 02:57:43,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:43,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125201500] [2019-11-28 02:57:43,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:43,858 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:43,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125201500] [2019-11-28 02:57:43,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358916531] [2019-11-28 02:57:43,859 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:57:43,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:57:43,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:57:43,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:57:43,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:43,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:57:43,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-28 02:57:43,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572292966] [2019-11-28 02:57:43,908 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:57:43,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:57:43,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:57:43,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:57:43,909 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 11 states. [2019-11-28 02:57:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:57:43,956 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-11-28 02:57:43,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:57:43,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-11-28 02:57:43,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 02:57:43,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-11-28 02:57:43,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 02:57:43,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 02:57:43,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-11-28 02:57:43,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:57:43,959 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-28 02:57:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-11-28 02:57:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-28 02:57:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 02:57:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-11-28 02:57:43,965 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-28 02:57:43,965 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-28 02:57:43,966 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 02:57:43,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-11-28 02:57:43,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 02:57:43,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:43,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:43,968 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:57:43,968 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 1, 1, 1] [2019-11-28 02:57:43,968 INFO L794 eck$LassoCheckResult]: Stem: 410#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 411#L19-2 [2019-11-28 02:57:43,969 INFO L796 eck$LassoCheckResult]: Loop: 411#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 412#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 414#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 422#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 421#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 420#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 419#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 418#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 417#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 416#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 415#L21-2 assume !(main_~x2~0 > 1); 413#L21-3 main_~x1~0 := 1 + main_~x1~0; 411#L19-2 [2019-11-28 02:57:43,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:43,969 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-11-28 02:57:43,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:43,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783527734] [2019-11-28 02:57:43,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:43,981 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:43,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:43,982 INFO L82 PathProgramCache]: Analyzing trace with hash 792845360, now seen corresponding path program 9 times [2019-11-28 02:57:43,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:43,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776175175] [2019-11-28 02:57:43,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:44,019 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:44,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:44,020 INFO L82 PathProgramCache]: Analyzing trace with hash 287286735, now seen corresponding path program 1 times [2019-11-28 02:57:44,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:44,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010270732] [2019-11-28 02:57:44,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:44,062 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:44,173 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-11-28 02:57:44,208 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:57:44,209 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:57:44,209 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:57:44,210 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:57:44,210 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:57:44,210 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:44,210 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:57:44,210 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:57:44,210 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration10_Loop [2019-11-28 02:57:44,210 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:57:44,211 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:57:44,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:44,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:44,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:44,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:44,302 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:57:44,303 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:44,317 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:44,317 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:44,327 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:57:44,328 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:44,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:44,338 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:44,342 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:57:44,343 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2019-11-28 02:57:44,356 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:44,356 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:44,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:57:44,424 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:44,435 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:57:44,438 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:57:44,438 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:57:44,438 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:57:44,439 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:57:44,439 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:57:44,439 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:44,439 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:57:44,439 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:57:44,439 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration10_Loop [2019-11-28 02:57:44,441 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:57:44,442 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:57:44,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:44,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:44,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:44,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:44,561 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:57:44,567 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 02:57:44,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:57:44,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:44,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:44,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:44,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:44,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:57:44,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:44,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:44,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:44,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:44,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:44,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:44,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:44,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:57:44,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:57:44,621 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:44,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:57:44,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:44,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:57:44,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:44,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:44,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:44,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:57:44,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:57:44,635 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:57:44,642 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:57:44,642 INFO L444 ModelExtractionUtils]: 0 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) [2019-11-28 02:57:44,651 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:57:44,652 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:57:44,652 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:57:44,653 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x1~0) = -2*ULTIMATE.start_main_~x1~0 + 21 Supporting invariants [] Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:44,664 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:57:44,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:44,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:57:44,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:44,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:57:44,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-28 02:57:44,758 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:57:44,759 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 3 states. [2019-11-28 02:57:44,795 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 25 states and 28 transitions. Complement of second has 4 states. [2019-11-28 02:57:44,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:57:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:57:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-28 02:57:44,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 12 letters. [2019-11-28 02:57:44,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:44,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 13 letters. Loop has 12 letters. [2019-11-28 02:57:44,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:44,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 24 letters. [2019-11-28 02:57:44,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:44,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2019-11-28 02:57:44,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 02:57:44,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 27 transitions. [2019-11-28 02:57:44,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 02:57:44,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 02:57:44,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2019-11-28 02:57:44,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:57:44,805 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-28 02:57:44,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2019-11-28 02:57:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2019-11-28 02:57:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 02:57:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-28 02:57:44,807 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-28 02:57:44,807 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-28 02:57:44,808 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 02:57:44,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-11-28 02:57:44,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 02:57:44,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:44,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:44,809 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 02:57:44,810 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 02:57:44,810 INFO L794 eck$LassoCheckResult]: Stem: 507#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 508#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 510#L21-2 [2019-11-28 02:57:44,810 INFO L796 eck$LassoCheckResult]: Loop: 510#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 510#L21-2 [2019-11-28 02:57:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:44,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-11-28 02:57:44,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:44,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137119377] [2019-11-28 02:57:44,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:44,818 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:44,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:44,819 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-11-28 02:57:44,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:44,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373075821] [2019-11-28 02:57:44,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:44,825 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:44,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:44,825 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-11-28 02:57:44,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:44,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34170390] [2019-11-28 02:57:44,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:44,833 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:44,849 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:57:44,849 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:57:44,849 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:57:44,850 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:57:44,850 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:57:44,850 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:44,850 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:57:44,850 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:57:44,850 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration11_Loop [2019-11-28 02:57:44,850 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:57:44,850 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:57:44,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:44,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:44,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:44,900 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:57:44,900 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 [2019-11-28 02:57:44,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:44,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:57:44,929 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:57:44,929 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=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) [2019-11-28 02:57:44,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:44,942 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:44,946 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:57:44,946 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} 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) [2019-11-28 02:57:44,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:44,964 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:44,996 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:57:44,996 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:57:45,009 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:57:45,013 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:57:45,013 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:57:45,013 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:57:45,013 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:57:45,013 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:57:45,013 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:45,013 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:57:45,013 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:57:45,014 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration11_Loop [2019-11-28 02:57:45,014 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:57:45,014 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:57:45,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:45,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:45,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:45,076 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:57:45,076 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 02:57:45,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:57:45,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:45,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:45,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:45,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:45,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:57:45,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:45,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:45,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:57:45,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:45,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:45,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:45,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:45,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:57:45,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:57:45,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:45,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:57:45,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:45,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:57:45,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:45,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:45,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:45,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:57:45,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:57:45,159 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:57:45,165 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:57:45,165 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:45,175 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:57:45,175 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:57:45,175 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:57:45,175 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0) = 1*ULTIMATE.start_main_~x2~0 Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:57:45,179 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:45,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:45,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:57:45,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:45,219 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:57:45,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:45,220 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-28 02:57:45,221 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 2 states. [2019-11-28 02:57:45,236 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 31 states and 36 transitions. Complement of second has 5 states. [2019-11-28 02:57:45,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:57:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-28 02:57:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-28 02:57:45,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2019-11-28 02:57:45,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:45,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2019-11-28 02:57:45,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:45,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-28 02:57:45,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:45,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2019-11-28 02:57:45,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 02:57:45,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 31 transitions. [2019-11-28 02:57:45,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-28 02:57:45,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-28 02:57:45,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2019-11-28 02:57:45,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:57:45,244 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-28 02:57:45,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2019-11-28 02:57:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-11-28 02:57:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 02:57:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-28 02:57:45,252 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-28 02:57:45,253 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-28 02:57:45,253 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 02:57:45,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-11-28 02:57:45,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 02:57:45,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:45,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:45,259 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 2, 1, 1, 1] [2019-11-28 02:57:45,260 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 02:57:45,260 INFO L794 eck$LassoCheckResult]: Stem: 582#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 583#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 584#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 588#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 596#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 595#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 594#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 593#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 592#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 591#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 590#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 589#L21-2 assume !(main_~x2~0 > 1); 587#L21-3 main_~x1~0 := 1 + main_~x1~0; 585#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 586#L21-2 [2019-11-28 02:57:45,260 INFO L796 eck$LassoCheckResult]: Loop: 586#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 586#L21-2 [2019-11-28 02:57:45,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:45,261 INFO L82 PathProgramCache]: Analyzing trace with hash 315954203, now seen corresponding path program 2 times [2019-11-28 02:57:45,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:45,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871563493] [2019-11-28 02:57:45,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:45,298 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:45,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:45,302 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-11-28 02:57:45,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:45,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434616775] [2019-11-28 02:57:45,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:45,309 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:45,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:45,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1204645720, now seen corresponding path program 3 times [2019-11-28 02:57:45,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:45,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86570292] [2019-11-28 02:57:45,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:45,347 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:45,359 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:57:45,359 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:57:45,359 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:57:45,359 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:57:45,359 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:57:45,359 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:45,360 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:57:45,360 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:57:45,360 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration12_Loop [2019-11-28 02:57:45,360 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:57:45,360 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:57:45,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:45,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:45,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:45,422 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:57:45,423 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:45,434 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:45,435 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:57:45,439 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:57:45,439 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2019-11-28 02:57:45,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:45,450 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:45,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:57:45,465 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 [2019-11-28 02:57:45,479 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:57:45,481 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:57:45,482 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:57:45,482 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:57:45,482 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:57:45,482 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:57:45,482 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:45,482 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:57:45,482 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:57:45,483 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration12_Loop [2019-11-28 02:57:45,483 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:57:45,483 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:57:45,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:45,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:45,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:45,533 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:57:45,533 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 02:57:45,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:57:45,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:45,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:45,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:45,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:45,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:57:45,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:45,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:45,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:57:45,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:45,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:57:45,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:45,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:45,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:45,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:57:45,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:45,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:57:45,582 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:57:45,582 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 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) [2019-11-28 02:57:45,588 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:57:45,589 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:57:45,589 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:57:45,589 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0) = 1*ULTIMATE.start_main_~x2~0 Supporting invariants [] [2019-11-28 02:57:45,603 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:45,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:45,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:57:45,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:45,675 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:57:45,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:45,676 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-28 02:57:45,676 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-11-28 02:57:45,698 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 29 states and 33 transitions. Complement of second has 5 states. [2019-11-28 02:57:45,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:57:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-28 02:57:45,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-28 02:57:45,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2019-11-28 02:57:45,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:45,702 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:57:45,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:45,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:57:45,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:45,735 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:57:45,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:45,736 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-28 02:57:45,736 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-11-28 02:57:45,746 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 29 states and 33 transitions. Complement of second has 5 states. [2019-11-28 02:57:45,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:57:45,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-28 02:57:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-28 02:57:45,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2019-11-28 02:57:45,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:45,749 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:57:45,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:45,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:57:45,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:45,779 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:57:45,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:45,780 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-28 02:57:45,780 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-11-28 02:57:45,811 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 18 states and 20 transitions. Complement of second has 4 states. [2019-11-28 02:57:45,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:57:45,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-28 02:57:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 02:57:45,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 1 letters. [2019-11-28 02:57:45,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:45,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 1 letters. [2019-11-28 02:57:45,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:45,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-28 02:57:45,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:45,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-11-28 02:57:45,819 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 02:57:45,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-11-28 02:57:45,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 02:57:45,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 02:57:45,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 02:57:45,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:57:45,820 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:57:45,820 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:57:45,820 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:57:45,820 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 02:57:45,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:57:45,821 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 02:57:45,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 02:57:45,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 02:57:45 BoogieIcfgContainer [2019-11-28 02:57:45,835 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 02:57:45,836 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:57:45,836 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:57:45,837 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:57:45,837 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:57:42" (3/4) ... [2019-11-28 02:57:45,842 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 02:57:45,842 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:57:45,844 INFO L168 Benchmark]: Toolchain (without parser) took 4295.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -142.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:57:45,845 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:57:45,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.46 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:57:45,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.58 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:57:45,847 INFO L168 Benchmark]: Boogie Preprocessor took 22.50 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:57:45,848 INFO L168 Benchmark]: RCFGBuilder took 213.45 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: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:57:45,852 INFO L168 Benchmark]: BuchiAutomizer took 3714.31 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. [2019-11-28 02:57:45,853 INFO L168 Benchmark]: Witness Printer took 6.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:57:45,856 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.46 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 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 31.58 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.50 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 213.45 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: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3714.31 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. * Witness Printer took 6.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (9 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * x1 + 21 and consists of 3 locations. One deterministic module has affine ranking function x2 and consists of 3 locations. One nondeterministic module has affine ranking function x2 and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 2.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 45/45 HoareTripleCheckerStatistics: 62 SDtfs, 21 SDslu, 50 SDs, 0 SdLazy, 157 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax203 hnf98 lsp42 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...