./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/Piecewise_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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/Piecewise_true-no-overflow_true-termination_true-valid-memsafety.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 36155f521cfe170e9c03fd915618e68821fe0430 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:14:18,882 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:14:18,884 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:14:18,897 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:14:18,898 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:14:18,899 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:14:18,901 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:14:18,904 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:14:18,906 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:14:18,907 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:14:18,908 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:14:18,908 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:14:18,910 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:14:18,911 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:14:18,912 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:14:18,913 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:14:18,915 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:14:18,917 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:14:18,920 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:14:18,922 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:14:18,923 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:14:18,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:14:18,928 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:14:18,928 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:14:18,928 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:14:18,929 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:14:18,931 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:14:18,932 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:14:18,933 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:14:18,934 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:14:18,935 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:14:18,935 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:14:18,936 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:14:18,936 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:14:18,937 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:14:18,938 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:14:18,939 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:14:18,957 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:14:18,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:14:18,958 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:14:18,958 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:14:18,959 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:14:18,959 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:14:18,960 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:14:18,960 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:14:18,960 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:14:18,960 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:14:18,960 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:14:18,961 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:14:18,961 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:14:18,961 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:14:18,961 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:14:18,961 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:14:18,961 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:14:18,963 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:14:18,963 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:14:18,963 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:14:18,963 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:14:18,963 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:14:18,964 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:14:18,964 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:14:18,964 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:14:18,964 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:14:18,964 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:14:18,965 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:14:18,966 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:14:18,966 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 -> 36155f521cfe170e9c03fd915618e68821fe0430 [2018-11-28 23:14:19,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:14:19,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:14:19,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:14:19,033 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:14:19,035 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:14:19,036 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/Piecewise_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:14:19,104 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc78c24d/17502e320b494a0e9eff4d12c525bcc9/FLAGc707b01c3 [2018-11-28 23:14:19,588 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:14:19,588 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/Piecewise_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:14:19,595 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc78c24d/17502e320b494a0e9eff4d12c525bcc9/FLAGc707b01c3 [2018-11-28 23:14:19,955 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc78c24d/17502e320b494a0e9eff4d12c525bcc9 [2018-11-28 23:14:19,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:14:19,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:14:19,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:14:19,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:14:19,966 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:14:19,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:14:19" (1/1) ... [2018-11-28 23:14:19,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b239d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:19, skipping insertion in model container [2018-11-28 23:14:19,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:14:19" (1/1) ... [2018-11-28 23:14:19,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:14:20,005 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:14:20,279 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:14:20,287 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:14:20,311 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:14:20,330 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:14:20,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:20 WrapperNode [2018-11-28 23:14:20,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:14:20,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:14:20,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:14:20,333 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:14:20,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:20" (1/1) ... [2018-11-28 23:14:20,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:20" (1/1) ... [2018-11-28 23:14:20,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:14:20,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:14:20,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:14:20,374 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:14:20,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:20" (1/1) ... [2018-11-28 23:14:20,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:20" (1/1) ... [2018-11-28 23:14:20,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:20" (1/1) ... [2018-11-28 23:14:20,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:20" (1/1) ... [2018-11-28 23:14:20,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:20" (1/1) ... [2018-11-28 23:14:20,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:20" (1/1) ... [2018-11-28 23:14:20,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:20" (1/1) ... [2018-11-28 23:14:20,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:14:20,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:14:20,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:14:20,395 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:14:20,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:20" (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 [2018-11-28 23:14:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:14:20,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:14:20,743 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:14:20,744 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:14:20,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:20 BoogieIcfgContainer [2018-11-28 23:14:20,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:14:20,745 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:14:20,745 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:14:20,749 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:14:20,750 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:14:20,750 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:14:19" (1/3) ... [2018-11-28 23:14:20,751 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2919f6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:14:20, skipping insertion in model container [2018-11-28 23:14:20,751 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:14:20,751 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:20" (2/3) ... [2018-11-28 23:14:20,752 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2919f6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:14:20, skipping insertion in model container [2018-11-28 23:14:20,752 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:14:20,752 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:20" (3/3) ... [2018-11-28 23:14:20,754 INFO L375 chiAutomizerObserver]: Analyzing ICFG Piecewise_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:14:20,822 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:14:20,823 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:14:20,826 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:14:20,826 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:14:20,828 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:14:20,828 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:14:20,828 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:14:20,828 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:14:20,828 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:14:20,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2018-11-28 23:14:20,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:20,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:20,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:20,915 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:14:20,915 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:14:20,916 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:14:20,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2018-11-28 23:14:20,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:20,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:20,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:20,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:14:20,919 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:14:20,933 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 8#L26-2true [2018-11-28 23:14:20,934 INFO L796 eck$LassoCheckResult]: Loop: 8#L26-2true assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 6#L23true assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 8#L26-2true [2018-11-28 23:14:20,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:20,945 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-28 23:14:20,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:20,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:21,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:21,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:21,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:21,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:21,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2018-11-28 23:14:21,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:21,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:21,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:21,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:21,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:21,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:21,103 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2018-11-28 23:14:21,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:21,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:21,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:21,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:21,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:21,239 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-11-28 23:14:21,281 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:21,283 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:21,283 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:21,283 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:21,284 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:21,284 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:21,284 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:21,285 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:21,285 INFO L131 ssoRankerPreferences]: Filename of dumped script: Piecewise_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-28 23:14:21,285 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:21,286 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:21,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:21,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:21,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:21,736 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 23:14:21,748 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:21,749 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) [2018-11-28 23:14:21,759 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:21,759 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 [2018-11-28 23:14:21,807 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:21,807 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 [2018-11-28 23:14:21,815 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:21,815 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:21,843 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:21,844 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 [2018-11-28 23:14:21,849 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:21,850 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 [2018-11-28 23:14:21,891 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:21,891 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:21,924 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:21,927 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:21,927 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:21,927 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:21,927 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:21,927 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:21,928 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:21,928 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:21,928 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:21,928 INFO L131 ssoRankerPreferences]: Filename of dumped script: Piecewise_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-28 23:14:21,928 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:21,928 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:21,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:21,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:21,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:22,143 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:22,149 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:22,151 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 [2018-11-28 23:14:22,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:22,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:22,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:22,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:22,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:22,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:22,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:22,170 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 [2018-11-28 23:14:22,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:22,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:22,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:22,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:22,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:22,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:22,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:22,185 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 [2018-11-28 23:14:22,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:22,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:22,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:22,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:22,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:22,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:22,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:22,199 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:22,209 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:22,209 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:22,212 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:22,212 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:22,212 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:22,213 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~q~0 Supporting invariants [] [2018-11-28 23:14:22,214 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:22,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:22,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:22,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:22,512 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:14:22,513 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2018-11-28 23:14:22,822 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 37 states and 48 transitions. Complement of second has 8 states. [2018-11-28 23:14:22,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:14:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-28 23:14:22,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 1 letters. Loop has 2 letters. [2018-11-28 23:14:22,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:22,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 23:14:22,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:22,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-28 23:14:22,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:22,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. [2018-11-28 23:14:22,844 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:14:22,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 13 states and 19 transitions. [2018-11-28 23:14:22,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:14:22,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:14:22,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2018-11-28 23:14:22,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:22,861 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-28 23:14:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2018-11-28 23:14:22,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-11-28 23:14:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:14:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2018-11-28 23:14:22,906 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-11-28 23:14:22,906 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-11-28 23:14:22,906 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:14:22,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2018-11-28 23:14:22,907 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:14:22,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:22,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:22,908 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:14:22,908 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:14:22,909 INFO L794 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 87#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 88#L23 [2018-11-28 23:14:22,910 INFO L796 eck$LassoCheckResult]: Loop: 88#L23 assume !(main_~q~0 < main_~p~0); 89#L26 assume !(main_~p~0 < main_~q~0); 92#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 88#L23 [2018-11-28 23:14:22,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:22,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2018-11-28 23:14:22,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:22,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:22,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:22,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:22,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:22,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:22,926 INFO L82 PathProgramCache]: Analyzing trace with hash 44836, now seen corresponding path program 1 times [2018-11-28 23:14:22,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:22,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:22,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:22,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:22,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:23,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:14:23,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:14:23,011 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:14:23,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:14:23,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:14:23,017 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-28 23:14:23,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:14:23,065 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-11-28 23:14:23,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:14:23,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-11-28 23:14:23,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:23,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2018-11-28 23:14:23,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:14:23,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:14:23,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2018-11-28 23:14:23,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:23,071 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-28 23:14:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2018-11-28 23:14:23,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-11-28 23:14:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:14:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-11-28 23:14:23,073 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2018-11-28 23:14:23,073 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2018-11-28 23:14:23,074 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:14:23,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2018-11-28 23:14:23,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:23,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:23,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:23,075 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:14:23,075 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:14:23,076 INFO L794 eck$LassoCheckResult]: Stem: 116#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 117#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 118#L23 assume !(main_~q~0 < main_~p~0); 114#L26 [2018-11-28 23:14:23,076 INFO L796 eck$LassoCheckResult]: Loop: 114#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 115#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 121#L23 assume !(main_~q~0 < main_~p~0); 114#L26 [2018-11-28 23:14:23,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:23,077 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-11-28 23:14:23,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:23,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:23,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:23,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:23,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:23,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:23,091 INFO L82 PathProgramCache]: Analyzing trace with hash 47414, now seen corresponding path program 1 times [2018-11-28 23:14:23,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:23,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:23,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:23,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:23,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:23,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:23,104 INFO L82 PathProgramCache]: Analyzing trace with hash 925832530, now seen corresponding path program 1 times [2018-11-28 23:14:23,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:23,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:23,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:23,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:23,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:23,218 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:23,218 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:23,218 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:23,218 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:23,219 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:23,219 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:23,219 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:23,219 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:23,219 INFO L131 ssoRankerPreferences]: Filename of dumped script: Piecewise_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-11-28 23:14:23,219 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:23,220 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:23,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:23,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:23,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:23,894 WARN L180 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-11-28 23:14:23,930 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:23,930 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 [2018-11-28 23:14:23,937 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:23,937 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:23,958 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:23,958 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 [2018-11-28 23:14:23,964 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:23,964 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 [2018-11-28 23:14:23,998 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:23,998 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:24,147 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:24,150 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:24,150 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:24,150 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:24,150 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:24,150 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:24,151 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:24,151 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:24,151 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:24,151 INFO L131 ssoRankerPreferences]: Filename of dumped script: Piecewise_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-11-28 23:14:24,151 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:24,151 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:24,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:24,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:24,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:24,341 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-11-28 23:14:24,400 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:24,401 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:24,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 [2018-11-28 23:14:24,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:24,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:24,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:24,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:24,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:24,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:24,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:24,413 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 [2018-11-28 23:14:24,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:24,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:24,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:24,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:24,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:24,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:24,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:24,425 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:24,434 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:24,435 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:24,435 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:24,435 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:24,436 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:24,436 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = 1*ULTIMATE.start_main_~p~0 Supporting invariants [] [2018-11-28 23:14:24,436 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:24,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:24,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:24,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:24,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:24,574 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 [2018-11-28 23:14:24,574 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-28 23:14:24,613 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 16 states and 20 transitions. Complement of second has 7 states. [2018-11-28 23:14:24,614 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 [2018-11-28 23:14:24,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:14:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-11-28 23:14:24,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-28 23:14:24,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:24,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 23:14:24,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:24,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-28 23:14:24,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:24,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-11-28 23:14:24,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:24,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 13 states and 17 transitions. [2018-11-28 23:14:24,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:14:24,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:14:24,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-28 23:14:24,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:24,619 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 23:14:24,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-28 23:14:24,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-11-28 23:14:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:14:24,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-11-28 23:14:24,622 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 23:14:24,622 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 23:14:24,623 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:14:24,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-11-28 23:14:24,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:24,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:24,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:24,624 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2018-11-28 23:14:24,624 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:14:24,625 INFO L794 eck$LassoCheckResult]: Stem: 185#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 186#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 190#L23 assume !(main_~q~0 < main_~p~0); 192#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 184#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 191#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 182#L26-2 [2018-11-28 23:14:24,625 INFO L796 eck$LassoCheckResult]: Loop: 182#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 187#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 182#L26-2 [2018-11-28 23:14:24,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:24,625 INFO L82 PathProgramCache]: Analyzing trace with hash 925832528, now seen corresponding path program 1 times [2018-11-28 23:14:24,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:24,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:24,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:24,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:24,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:24,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:24,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2018-11-28 23:14:24,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:24,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:24,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:24,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:24,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:24,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:24,666 INFO L82 PathProgramCache]: Analyzing trace with hash 666829459, now seen corresponding path program 2 times [2018-11-28 23:14:24,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:24,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:24,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:24,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:24,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:24,767 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:24,767 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:24,767 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:24,767 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:24,767 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:24,768 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:24,768 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:24,768 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:24,768 INFO L131 ssoRankerPreferences]: Filename of dumped script: Piecewise_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2018-11-28 23:14:24,768 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:24,768 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:24,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:24,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:24,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:24,910 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:24,911 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:24,916 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:24,916 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-28 23:14:24,948 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:24,948 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:24,975 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:24,977 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:24,978 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:24,978 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:24,978 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:24,978 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:24,978 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:24,978 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:24,978 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:24,979 INFO L131 ssoRankerPreferences]: Filename of dumped script: Piecewise_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2018-11-28 23:14:24,979 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:24,979 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:24,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:25,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:25,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:25,284 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 23:14:25,305 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:25,306 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:25,306 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 [2018-11-28 23:14:25,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:25,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:25,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:25,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:25,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:25,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:25,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:25,319 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:25,333 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:25,333 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:25,334 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:25,334 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:25,334 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:25,334 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~q~0 Supporting invariants [] [2018-11-28 23:14:25,336 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:25,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:25,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:25,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:25,401 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:14:25,401 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 23:14:25,432 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 27 states and 34 transitions. Complement of second has 5 states. [2018-11-28 23:14:25,434 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 [2018-11-28 23:14:25,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:14:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-28 23:14:25,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 23:14:25,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:25,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 23:14:25,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:25,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:14:25,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:25,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-11-28 23:14:25,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:25,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 30 transitions. [2018-11-28 23:14:25,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:14:25,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:14:25,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2018-11-28 23:14:25,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:25,441 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-28 23:14:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2018-11-28 23:14:25,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-28 23:14:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:14:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-11-28 23:14:25,445 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-28 23:14:25,445 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-28 23:14:25,445 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:14:25,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-11-28 23:14:25,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:25,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:25,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:25,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1] [2018-11-28 23:14:25,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:14:25,448 INFO L794 eck$LassoCheckResult]: Stem: 268#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 269#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 272#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 273#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 276#L23 assume !(main_~q~0 < main_~p~0); 265#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 266#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 279#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 280#L26-2 [2018-11-28 23:14:25,450 INFO L796 eck$LassoCheckResult]: Loop: 280#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 281#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 280#L26-2 [2018-11-28 23:14:25,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:25,450 INFO L82 PathProgramCache]: Analyzing trace with hash 602336749, now seen corresponding path program 3 times [2018-11-28 23:14:25,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:25,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:25,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:25,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:25,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:25,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:25,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2018-11-28 23:14:25,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:25,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:25,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:25,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:25,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:25,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:25,500 INFO L82 PathProgramCache]: Analyzing trace with hash -974968848, now seen corresponding path program 4 times [2018-11-28 23:14:25,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:25,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:25,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:25,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:25,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:25,576 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:25,577 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:25,577 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:25,577 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:25,577 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:25,577 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:25,577 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:25,578 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:25,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: Piecewise_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-11-28 23:14:25,578 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:25,578 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:25,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:25,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:25,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:25,672 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:25,672 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2018-11-28 23:14:25,677 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:25,677 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 [2018-11-28 23:14:25,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:25,702 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:25,727 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:25,730 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:25,730 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:25,730 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:25,730 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:25,730 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:25,730 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:25,730 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:25,730 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:25,730 INFO L131 ssoRankerPreferences]: Filename of dumped script: Piecewise_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-11-28 23:14:25,731 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:25,731 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:25,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:25,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:25,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:25,814 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:25,814 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:25,815 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 [2018-11-28 23:14:25,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:25,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:25,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:25,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:25,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:25,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:25,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:25,822 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:25,825 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:25,826 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:25,826 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:25,826 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:25,826 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:25,826 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~q~0 Supporting invariants [] [2018-11-28 23:14:25,827 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:25,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:25,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:25,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:25,903 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:14:25,903 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 23:14:25,934 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 29 states and 38 transitions. Complement of second has 5 states. [2018-11-28 23:14:25,935 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 [2018-11-28 23:14:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:14:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-28 23:14:25,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 23:14:25,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:25,936 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:25,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:25,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:25,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:25,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:26,000 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:14:26,000 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 23:14:26,027 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 29 states and 38 transitions. Complement of second has 5 states. [2018-11-28 23:14:26,029 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 [2018-11-28 23:14:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:14:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-28 23:14:26,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 23:14:26,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:26,030 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:26,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:26,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:26,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:26,098 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 2 loop predicates [2018-11-28 23:14:26,098 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 23:14:26,122 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 33 states and 45 transitions. Complement of second has 4 states. [2018-11-28 23:14:26,123 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 [2018-11-28 23:14:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:14:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 23:14:26,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 23:14:26,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:26,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 23:14:26,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:26,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 23:14:26,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:26,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2018-11-28 23:14:26,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:14:26,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 27 states and 36 transitions. [2018-11-28 23:14:26,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:14:26,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:14:26,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2018-11-28 23:14:26,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:26,130 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-28 23:14:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2018-11-28 23:14:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2018-11-28 23:14:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:14:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-11-28 23:14:26,133 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-28 23:14:26,133 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-28 23:14:26,133 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:14:26,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2018-11-28 23:14:26,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:14:26,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:26,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:26,135 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2018-11-28 23:14:26,135 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1] [2018-11-28 23:14:26,135 INFO L794 eck$LassoCheckResult]: Stem: 503#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 504#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 512#L23 assume !(main_~q~0 < main_~p~0); 511#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 502#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 509#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 510#L26-2 [2018-11-28 23:14:26,135 INFO L796 eck$LassoCheckResult]: Loop: 510#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 505#L23 assume !(main_~q~0 < main_~p~0); 499#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 500#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 508#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 510#L26-2 [2018-11-28 23:14:26,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash 925832528, now seen corresponding path program 5 times [2018-11-28 23:14:26,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:26,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:26,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:26,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:26,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:26,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:26,146 INFO L82 PathProgramCache]: Analyzing trace with hash 38328847, now seen corresponding path program 1 times [2018-11-28 23:14:26,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:26,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:26,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:26,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:26,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:26,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:26,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1292746272, now seen corresponding path program 6 times [2018-11-28 23:14:26,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:26,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:26,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:26,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:26,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:26,279 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:26,280 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:26,280 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:26,280 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:26,280 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:26,280 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:26,281 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:26,281 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:26,281 INFO L131 ssoRankerPreferences]: Filename of dumped script: Piecewise_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2018-11-28 23:14:26,281 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:26,282 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:26,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:26,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:26,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:26,478 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:26,478 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 [2018-11-28 23:14:26,484 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:26,484 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 [2018-11-28 23:14:26,514 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:26,514 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:26,606 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:26,609 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:26,609 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:26,609 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:26,609 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:26,609 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:26,609 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:26,609 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:26,609 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:26,609 INFO L131 ssoRankerPreferences]: Filename of dumped script: Piecewise_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2018-11-28 23:14:26,610 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:26,610 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:26,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:26,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:26,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:26,745 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:26,745 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:26,746 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 [2018-11-28 23:14:26,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:26,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:26,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:26,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:26,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:26,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:26,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:26,753 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:26,758 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:26,760 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:26,760 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:26,760 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:26,760 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:26,760 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~q~0 Supporting invariants [] [2018-11-28 23:14:26,761 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:26,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:26,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:26,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:26,891 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:14:26,891 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-28 23:14:27,114 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9. Second operand 6 states. Result 41 states and 58 transitions. Complement of second has 10 states. [2018-11-28 23:14:27,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:27,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:14:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-28 23:14:27,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 5 letters. [2018-11-28 23:14:27,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:27,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-28 23:14:27,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:27,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 10 letters. [2018-11-28 23:14:27,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:27,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2018-11-28 23:14:27,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:27,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 34 states and 48 transitions. [2018-11-28 23:14:27,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:14:27,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:14:27,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 48 transitions. [2018-11-28 23:14:27,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:27,125 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2018-11-28 23:14:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 48 transitions. [2018-11-28 23:14:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2018-11-28 23:14:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 23:14:27,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-11-28 23:14:27,130 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-11-28 23:14:27,130 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-11-28 23:14:27,130 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:14:27,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2018-11-28 23:14:27,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:14:27,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:27,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:27,134 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1] [2018-11-28 23:14:27,134 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:14:27,134 INFO L794 eck$LassoCheckResult]: Stem: 625#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 626#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 637#L23 assume !(main_~q~0 < main_~p~0); 621#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 622#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 634#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 635#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 631#L23 [2018-11-28 23:14:27,135 INFO L796 eck$LassoCheckResult]: Loop: 631#L23 assume !(main_~q~0 < main_~p~0); 633#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 630#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 631#L23 [2018-11-28 23:14:27,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:27,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1363962694, now seen corresponding path program 7 times [2018-11-28 23:14:27,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:27,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:27,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:27,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:27,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:27,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:27,161 INFO L82 PathProgramCache]: Analyzing trace with hash 44774, now seen corresponding path program 2 times [2018-11-28 23:14:27,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:27,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:27,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:27,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:27,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:27,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:27,173 INFO L82 PathProgramCache]: Analyzing trace with hash 872985485, now seen corresponding path program 8 times [2018-11-28 23:14:27,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:27,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:27,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:27,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:27,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:27,322 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-11-28 23:14:27,335 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:27,335 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:27,335 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:27,336 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:27,336 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:27,336 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:27,336 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:27,336 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:27,336 INFO L131 ssoRankerPreferences]: Filename of dumped script: Piecewise_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2018-11-28 23:14:27,337 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:27,337 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:27,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:27,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:27,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:27,489 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:27,489 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:27,497 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:27,497 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:27,520 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:27,520 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:27,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:27,530 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:27,554 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:27,554 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:27,560 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:27,560 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:27,588 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:27,588 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:27,873 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:27,876 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:27,876 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:27,876 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:27,876 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:27,876 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:27,876 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:27,877 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:27,877 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:27,877 INFO L131 ssoRankerPreferences]: Filename of dumped script: Piecewise_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2018-11-28 23:14:27,877 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:27,877 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:27,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:27,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:27,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:28,093 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2018-11-28 23:14:28,095 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:28,095 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:28,096 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 [2018-11-28 23:14:28,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:28,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:28,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:28,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:28,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:28,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:28,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:28,103 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 [2018-11-28 23:14:28,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:28,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:28,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:28,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:28,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:28,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:28,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:28,108 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 [2018-11-28 23:14:28,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:28,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:28,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:28,109 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:14:28,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:28,110 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:14:28,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:28,117 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:28,120 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:28,120 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:28,120 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:28,120 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:28,121 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:28,121 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = 1*ULTIMATE.start_main_~p~0 Supporting invariants [] [2018-11-28 23:14:28,121 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:28,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:28,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:28,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:28,182 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:14:28,182 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-28 23:14:28,213 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 27 states and 40 transitions. Complement of second has 7 states. [2018-11-28 23:14:28,214 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 [2018-11-28 23:14:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:14:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2018-11-28 23:14:28,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:14:28,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:28,215 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:28,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:28,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:28,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:28,268 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:14:28,268 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-28 23:14:28,288 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 27 states and 40 transitions. Complement of second has 7 states. [2018-11-28 23:14:28,290 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 [2018-11-28 23:14:28,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:14:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2018-11-28 23:14:28,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:14:28,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:28,292 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:28,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:28,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:28,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:28,328 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 2 loop predicates [2018-11-28 23:14:28,328 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-28 23:14:28,357 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 36 states and 57 transitions. Complement of second has 6 states. [2018-11-28 23:14:28,361 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 [2018-11-28 23:14:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:14:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-28 23:14:28,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:14:28,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:28,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 23:14:28,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:28,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 23:14:28,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:28,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 57 transitions. [2018-11-28 23:14:28,366 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:14:28,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2018-11-28 23:14:28,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:14:28,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:14:28,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:14:28,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:14:28,368 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:28,368 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:28,368 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:28,368 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:14:28,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:14:28,368 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:14:28,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:14:28,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:14:28 BoogieIcfgContainer [2018-11-28 23:14:28,380 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:14:28,381 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:14:28,381 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:14:28,381 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:14:28,382 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:20" (3/4) ... [2018-11-28 23:14:28,389 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:14:28,389 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:14:28,390 INFO L168 Benchmark]: Toolchain (without parser) took 8431.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -49.6 MB). Peak memory consumption was 130.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:28,393 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:28,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.80 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:28,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.91 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:28,395 INFO L168 Benchmark]: Boogie Preprocessor took 21.03 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:28,395 INFO L168 Benchmark]: RCFGBuilder took 349.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -131.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:28,397 INFO L168 Benchmark]: BuchiAutomizer took 7635.66 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.2 MB). Peak memory consumption was 153.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:28,398 INFO L168 Benchmark]: Witness Printer took 8.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:28,404 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 370.80 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.91 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.03 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 349.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -131.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7635.66 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.2 MB). Peak memory consumption was 153.5 MB. Max. memory is 11.5 GB. * Witness Printer took 8.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (1 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function q and consists of 5 locations. One deterministic module has affine ranking function p and consists of 4 locations. One deterministic module has affine ranking function q and consists of 3 locations. One deterministic module has affine ranking function q and consists of 6 locations. One nondeterministic module has affine ranking function q and consists of 3 locations. One nondeterministic module has affine ranking function p and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.5s. Construction of modules took 0.5s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 27 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 49 SDtfs, 56 SDslu, 9 SDs, 0 SdLazy, 120 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax162 hnf99 lsp61 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp93 dnf112 smp98 tf107 neg98 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...