./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-cousot9_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-cousot9_true-termination_true-no-overflow.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 0a8f096dedbbe798ef2fe808d4231fc7a503c17f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:33:25,133 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:33:25,137 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:33:25,153 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:33:25,154 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:33:25,155 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:33:25,157 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:33:25,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:33:25,168 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:33:25,169 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:33:25,171 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:33:25,172 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:33:25,173 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:33:25,174 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:33:25,175 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:33:25,176 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:33:25,177 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:33:25,180 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:33:25,182 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:33:25,184 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:33:25,185 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:33:25,187 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:33:25,189 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:33:25,190 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:33:25,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:33:25,191 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:33:25,192 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:33:25,193 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:33:25,195 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:33:25,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:33:25,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:33:25,198 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:33:25,198 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:33:25,198 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:33:25,200 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:33:25,201 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:33:25,201 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:33:25,220 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:33:25,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:33:25,221 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:33:25,222 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:33:25,222 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:33:25,222 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:33:25,223 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:33:25,223 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:33:25,223 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:33:25,223 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:33:25,223 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:33:25,224 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:33:25,224 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:33:25,224 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:33:25,224 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:33:25,224 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:33:25,226 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:33:25,226 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:33:25,226 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:33:25,227 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:33:25,227 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:33:25,227 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:33:25,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:33:25,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:33:25,227 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:33:25,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:33:25,228 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:33:25,228 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:33:25,231 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:33:25,232 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 0a8f096dedbbe798ef2fe808d4231fc7a503c17f [2019-01-01 21:33:25,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:33:25,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:33:25,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:33:25,337 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:33:25,338 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:33:25,339 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-cousot9_true-termination_true-no-overflow.c [2019-01-01 21:33:25,415 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f51983ac2/24b2f4b037ac482b85d0bc9788d030c0/FLAG52c96a46c [2019-01-01 21:33:25,882 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:33:25,882 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-cousot9_true-termination_true-no-overflow.c [2019-01-01 21:33:25,890 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f51983ac2/24b2f4b037ac482b85d0bc9788d030c0/FLAG52c96a46c [2019-01-01 21:33:26,215 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f51983ac2/24b2f4b037ac482b85d0bc9788d030c0 [2019-01-01 21:33:26,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:33:26,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:33:26,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:26,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:33:26,228 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:33:26,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:26" (1/1) ... [2019-01-01 21:33:26,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43342a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26, skipping insertion in model container [2019-01-01 21:33:26,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:26" (1/1) ... [2019-01-01 21:33:26,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:33:26,263 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:33:26,456 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:26,462 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:33:26,484 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:26,503 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:33:26,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26 WrapperNode [2019-01-01 21:33:26,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:26,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:26,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:33:26,505 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:33:26,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26" (1/1) ... [2019-01-01 21:33:26,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26" (1/1) ... [2019-01-01 21:33:26,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:26,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:33:26,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:33:26,558 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:33:26,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26" (1/1) ... [2019-01-01 21:33:26,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26" (1/1) ... [2019-01-01 21:33:26,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26" (1/1) ... [2019-01-01 21:33:26,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26" (1/1) ... [2019-01-01 21:33:26,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26" (1/1) ... [2019-01-01 21:33:26,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26" (1/1) ... [2019-01-01 21:33:26,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26" (1/1) ... [2019-01-01 21:33:26,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:33:26,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:33:26,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:33:26,588 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:33:26,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26" (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-01-01 21:33:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:33:26,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:33:27,013 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:33:27,013 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:33:27,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:27 BoogieIcfgContainer [2019-01-01 21:33:27,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:33:27,015 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:33:27,015 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:33:27,020 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:33:27,021 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:27,021 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:33:26" (1/3) ... [2019-01-01 21:33:27,023 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27693889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:27, skipping insertion in model container [2019-01-01 21:33:27,023 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:27,023 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26" (2/3) ... [2019-01-01 21:33:27,024 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27693889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:27, skipping insertion in model container [2019-01-01 21:33:27,024 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:27,024 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:27" (3/3) ... [2019-01-01 21:33:27,026 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-cousot9_true-termination_true-no-overflow.c [2019-01-01 21:33:27,093 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:33:27,094 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:33:27,094 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:33:27,094 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:33:27,094 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:33:27,094 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:33:27,095 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:33:27,095 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:33:27,095 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:33:27,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:33:27,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:27,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:27,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:27,143 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:33:27,143 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:27,143 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:33:27,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:33:27,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:27,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:27,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:27,145 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:33:27,145 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:27,155 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~N~0;main_~j~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~N~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~i~0 := main_~N~0; 6#L19-2true [2019-01-01 21:33:27,156 INFO L796 eck$LassoCheckResult]: Loop: 6#L19-2true assume !!(main_~i~0 > 0); 8#L19true assume main_~j~0 > 0;main_~j~0 := main_~j~0 - 1; 6#L19-2true [2019-01-01 21:33:27,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:27,172 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:33:27,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:27,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:27,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:27,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:27,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:27,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:27,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-01-01 21:33:27,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:27,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:27,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:27,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:27,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:27,319 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-01 21:33:27,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:27,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:27,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:27,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:27,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:27,467 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 21:33:27,567 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:27,568 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:27,569 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:27,569 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:27,569 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:27,569 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:27,570 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:27,570 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:27,571 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-cousot9_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:33:27,571 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:27,571 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:27,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:27,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:27,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:27,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:27,825 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:27,826 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:33:27,840 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:27,841 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:27,878 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:27,878 INFO L448 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 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:27,887 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:27,887 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:27,909 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:27,910 INFO L448 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:27,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:27,920 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:27,946 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:27,946 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:27,990 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:27,993 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:27,993 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:27,994 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:27,994 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:27,994 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:27,994 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:27,994 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:27,994 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:27,996 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-cousot9_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:33:27,996 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:27,996 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:28,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:28,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:28,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:28,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:28,257 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 21:33:28,388 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:28,394 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:28,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:28,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:28,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:28,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:28,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:28,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:28,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:28,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:28,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:28,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:28,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:28,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:28,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:28,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:28,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:28,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:28,439 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:28,444 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:28,445 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:28,448 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:28,448 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:28,448 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:28,449 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-01 21:33:28,451 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:28,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:28,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:28,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:28,627 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-01-01 21:33:28,629 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-01-01 21:33:28,683 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2019-01-01 21:33:28,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:33:28,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-01 21:33:28,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:28,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:33:28,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:28,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-01 21:33:28,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:28,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-01 21:33:28,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:28,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-01 21:33:28,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:33:28,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:33:28,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-01 21:33:28,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:28,705 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:33:28,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-01 21:33:28,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-01 21:33:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:33:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-01 21:33:28,732 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:33:28,732 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:33:28,732 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:33:28,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-01 21:33:28,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:28,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:28,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:28,734 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:33:28,734 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:28,734 INFO L794 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~N~0;main_~j~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~N~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~i~0 := main_~N~0; 64#L19-2 assume !!(main_~i~0 > 0); 69#L19 assume !(main_~j~0 > 0);main_~j~0 := main_~N~0;main_~i~0 := main_~i~0 - 1; 65#L19-2 [2019-01-01 21:33:28,734 INFO L796 eck$LassoCheckResult]: Loop: 65#L19-2 assume !!(main_~i~0 > 0); 66#L19 assume main_~j~0 > 0;main_~j~0 := main_~j~0 - 1; 65#L19-2 [2019-01-01 21:33:28,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:28,735 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-01-01 21:33:28,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:28,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:28,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:28,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:28,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:28,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:28,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-01-01 21:33:28,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:28,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:28,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:28,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:28,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:28,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:28,764 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-01-01 21:33:28,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:28,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:28,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:28,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:28,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:28,822 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:28,822 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:28,822 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:28,822 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:28,822 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:28,823 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:28,823 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:28,823 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:28,823 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-cousot9_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:33:28,824 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:28,824 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:28,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:28,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:28,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:28,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:29,021 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:29,021 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:29,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:29,027 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:29,048 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:29,048 INFO L448 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:29,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:29,053 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:29,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:29,079 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:29,104 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:29,107 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:29,107 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:29,107 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:29,107 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:29,107 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:29,108 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:29,108 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:29,108 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:29,108 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-cousot9_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:33:29,108 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:29,108 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:29,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:29,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:29,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:29,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:29,266 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:29,266 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:29,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:29,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:29,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:29,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:29,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:29,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:29,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:29,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:29,281 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:29,286 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:29,286 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:29,287 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:29,287 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:29,287 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:29,287 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-01 21:33:29,289 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:29,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:29,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:29,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:29,455 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-01-01 21:33:29,457 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:33:29,535 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2019-01-01 21:33:29,537 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-01-01 21:33:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:33:29,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:33:29,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:29,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:33:29,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:29,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-01 21:33:29,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:29,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-01-01 21:33:29,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:29,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-01-01 21:33:29,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:33:29,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:33:29,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-01-01 21:33:29,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:29,552 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:33:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-01-01 21:33:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-01 21:33:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:33:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-01-01 21:33:29,559 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:33:29,560 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:33:29,560 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:33:29,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-01-01 21:33:29,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:29,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:29,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:29,564 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-01 21:33:29,565 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:29,565 INFO L794 eck$LassoCheckResult]: Stem: 116#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~N~0;main_~j~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~N~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~i~0 := main_~N~0; 117#L19-2 assume !!(main_~i~0 > 0); 122#L19 assume !(main_~j~0 > 0);main_~j~0 := main_~N~0;main_~i~0 := main_~i~0 - 1; 123#L19-2 assume !!(main_~i~0 > 0); 124#L19 assume !(main_~j~0 > 0);main_~j~0 := main_~N~0;main_~i~0 := main_~i~0 - 1; 118#L19-2 [2019-01-01 21:33:29,565 INFO L796 eck$LassoCheckResult]: Loop: 118#L19-2 assume !!(main_~i~0 > 0); 119#L19 assume main_~j~0 > 0;main_~j~0 := main_~j~0 - 1; 118#L19-2 [2019-01-01 21:33:29,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:29,566 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2019-01-01 21:33:29,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:29,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:29,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:29,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:29,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:29,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:33:29,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:33:29,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:33:29,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:33:29,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:33:29,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:29,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:33:29,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-01-01 21:33:29,946 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:33:29,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:29,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-01-01 21:33:29,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:29,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:29,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:29,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:29,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:29,978 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:29,979 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:29,979 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:29,979 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:29,979 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:29,979 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:29,979 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:29,979 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:29,980 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-cousot9_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:33:29,980 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:29,980 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:29,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:29,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:30,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:30,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:30,149 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:30,149 INFO L412 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:30,153 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:30,153 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:30,173 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:30,173 INFO L448 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 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:30,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:30,180 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:30,205 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:30,205 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:30,228 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:30,230 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:30,230 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:30,231 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:30,231 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:30,231 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:30,231 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:30,231 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:30,231 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:30,231 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-cousot9_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:33:30,231 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:30,232 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:30,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:30,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:30,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:30,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:30,390 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:30,390 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:30,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:30,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:30,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:30,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:30,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:30,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:30,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:30,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:30,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:30,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:30,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:30,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:30,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:30,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:30,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:30,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:30,411 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:30,414 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:30,415 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:30,415 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:30,415 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:30,415 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:30,416 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-01 21:33:30,416 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:30,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:30,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:30,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:30,492 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-01-01 21:33:30,492 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:33:30,503 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-01-01 21:33:30,504 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-01-01 21:33:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:33:30,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:33:30,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:30,506 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:30,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:30,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:30,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:30,563 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-01-01 21:33:30,563 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:33:30,578 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-01-01 21:33:30,579 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-01-01 21:33:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:33:30,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:33:30,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:30,580 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:30,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:30,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:30,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:30,626 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-01-01 21:33:30,626 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:33:30,648 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2019-01-01 21:33:30,649 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-01-01 21:33:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:33:30,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:33:30,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:30,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:33:30,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:30,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:33:30,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:30,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2019-01-01 21:33:30,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:33:30,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-01-01 21:33:30,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:33:30,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:33:30,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-01-01 21:33:30,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:30,657 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-01 21:33:30,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-01-01 21:33:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2019-01-01 21:33:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:33:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-01-01 21:33:30,660 INFO L728 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-01-01 21:33:30,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:33:30,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:33:30,667 INFO L87 Difference]: Start difference. First operand 5 states and 7 transitions. Second operand 7 states. [2019-01-01 21:33:30,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:33:30,758 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-01-01 21:33:30,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:33:30,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2019-01-01 21:33:30,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:33:30,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 10 states and 13 transitions. [2019-01-01 21:33:30,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:33:30,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:33:30,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-01 21:33:30,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:30,761 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:33:30,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-01 21:33:30,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 6. [2019-01-01 21:33:30,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:33:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-01 21:33:30,762 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-01 21:33:30,763 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-01 21:33:30,763 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:33:30,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2019-01-01 21:33:30,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:33:30,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:30,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:30,764 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:33:30,764 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-01-01 21:33:30,764 INFO L794 eck$LassoCheckResult]: Stem: 295#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~N~0;main_~j~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~N~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~i~0 := main_~N~0; 296#L19-2 assume !!(main_~i~0 > 0); 300#L19 [2019-01-01 21:33:30,764 INFO L796 eck$LassoCheckResult]: Loop: 300#L19 assume !(main_~j~0 > 0);main_~j~0 := main_~N~0;main_~i~0 := main_~i~0 - 1; 297#L19-2 assume !!(main_~i~0 > 0); 298#L19 assume main_~j~0 > 0;main_~j~0 := main_~j~0 - 1; 299#L19-2 assume !!(main_~i~0 > 0); 300#L19 [2019-01-01 21:33:30,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:30,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-01 21:33:30,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:30,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:30,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:30,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:30,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:30,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:30,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2019-01-01 21:33:30,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:30,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:30,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:30,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:30,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:30,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:30,780 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 2 times [2019-01-01 21:33:30,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:30,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:30,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:30,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:30,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:30,865 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:30,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:30,866 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:30,866 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:30,866 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:30,866 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:30,866 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:30,867 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:30,867 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-cousot9_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:33:30,867 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:30,867 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:30,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:30,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:30,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:30,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:31,114 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:31,115 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:31,120 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:31,120 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:31,145 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:31,145 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:31,199 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:31,201 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:31,202 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:31,202 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:31,202 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:31,202 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:31,202 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:31,202 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:31,202 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:31,202 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-cousot9_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:33:31,203 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:31,203 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:31,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:31,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:31,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:31,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:31,298 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:31,299 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:31,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:31,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:31,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:31,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:31,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:31,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:31,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:31,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:31,306 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:31,310 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:31,310 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:31,310 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:31,310 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:31,311 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:31,311 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-01 21:33:31,311 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:31,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:31,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:31,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:31,419 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:33:31,419 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-01 21:33:31,437 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 18 states and 24 transitions. Complement of second has 6 states. [2019-01-01 21:33:31,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-01 21:33:31,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:33:31,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:31,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:33:31,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:31,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-01 21:33:31,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:31,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-01-01 21:33:31,441 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:31,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-01-01 21:33:31,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:33:31,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:33:31,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:33:31,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:33:31,442 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:31,442 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:31,443 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:31,443 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:33:31,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:33:31,443 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:31,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:33:31,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:33:31 BoogieIcfgContainer [2019-01-01 21:33:31,453 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:33:31,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:33:31,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:33:31,453 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:33:31,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:27" (3/4) ... [2019-01-01 21:33:31,459 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:33:31,460 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:33:31,460 INFO L168 Benchmark]: Toolchain (without parser) took 5239.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 947.3 MB in the beginning and 860.5 MB in the end (delta: 86.8 MB). Peak memory consumption was 213.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:31,462 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:31,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.37 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 935.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:31,464 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.01 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:31,465 INFO L168 Benchmark]: Boogie Preprocessor took 29.80 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:31,465 INFO L168 Benchmark]: RCFGBuilder took 426.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:31,466 INFO L168 Benchmark]: BuchiAutomizer took 4437.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 860.5 MB in the end (delta: 249.9 MB). Peak memory consumption was 249.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:31,467 INFO L168 Benchmark]: Witness Printer took 6.51 ms. Allocated memory is still 1.2 GB. Free memory is still 860.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:31,472 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 281.37 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 935.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.01 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.80 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 426.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4437.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 860.5 MB in the end (delta: 249.9 MB). Peak memory consumption was 249.9 MB. Max. memory is 11.5 GB. * Witness Printer took 6.51 ms. Allocated memory is still 1.2 GB. Free memory is still 860.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function j and consists of 4 locations. One deterministic module has affine ranking function j and consists of 3 locations. One deterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function j and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 31 SDtfs, 32 SDslu, 10 SDs, 0 SdLazy, 40 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax182 hnf99 lsp39 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 smp100 dnf100 smp100 tf112 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...