./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-linkedlists/cll_traverse-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-linkedlists/cll_traverse-alloca_false-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a2a51f996e4cf34954505c04e8fa9e53d244d46a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:54:34,906 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:54:34,908 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:54:34,920 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:54:34,921 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:54:34,922 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:54:34,923 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:54:34,925 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:54:34,927 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:54:34,928 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:54:34,929 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:54:34,929 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:54:34,930 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:54:34,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:54:34,933 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:54:34,933 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:54:34,934 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:54:34,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:54:34,939 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:54:34,941 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:54:34,942 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:54:34,943 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:54:34,946 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:54:34,947 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:54:34,947 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:54:34,948 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:54:34,949 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:54:34,950 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:54:34,951 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:54:34,952 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:54:34,953 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:54:34,953 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:54:34,954 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:54:34,954 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:54:34,955 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:54:34,956 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:54:34,956 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:54:34,979 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:54:34,980 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:54:34,984 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:54:34,984 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:54:34,984 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:54:34,985 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:54:34,985 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:54:34,985 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:54:34,985 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:54:34,985 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:54:34,985 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:54:34,987 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:54:34,988 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:54:34,988 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:54:34,988 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:54:34,988 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:54:34,988 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:54:34,988 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:54:34,990 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:54:34,991 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:54:34,991 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:54:34,991 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:54:34,991 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:54:34,991 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:54:34,992 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:54:34,993 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:54:34,993 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:54:34,993 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:54:34,994 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:54:34,994 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 -> a2a51f996e4cf34954505c04e8fa9e53d244d46a [2019-01-01 21:54:35,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:54:35,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:54:35,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:54:35,091 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:54:35,091 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:54:35,092 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-linkedlists/cll_traverse-alloca_false-termination.c.i [2019-01-01 21:54:35,169 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77f0564e/704b55952e114440a078c05d96a246b9/FLAGe3346eb51 [2019-01-01 21:54:35,730 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:54:35,731 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-linkedlists/cll_traverse-alloca_false-termination.c.i [2019-01-01 21:54:35,752 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77f0564e/704b55952e114440a078c05d96a246b9/FLAGe3346eb51 [2019-01-01 21:54:35,978 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77f0564e/704b55952e114440a078c05d96a246b9 [2019-01-01 21:54:35,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:54:35,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:54:35,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:54:35,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:54:35,992 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:54:35,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:54:35" (1/1) ... [2019-01-01 21:54:35,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@100847a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:35, skipping insertion in model container [2019-01-01 21:54:35,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:54:35" (1/1) ... [2019-01-01 21:54:36,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:54:36,057 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:54:36,467 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:54:36,491 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:54:36,615 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:54:36,671 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:54:36,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:36 WrapperNode [2019-01-01 21:54:36,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:54:36,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:54:36,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:54:36,673 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:54:36,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:36" (1/1) ... [2019-01-01 21:54:36,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:36" (1/1) ... [2019-01-01 21:54:36,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:54:36,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:54:36,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:54:36,746 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:54:36,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:36" (1/1) ... [2019-01-01 21:54:36,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:36" (1/1) ... [2019-01-01 21:54:36,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:36" (1/1) ... [2019-01-01 21:54:36,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:36" (1/1) ... [2019-01-01 21:54:36,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:36" (1/1) ... [2019-01-01 21:54:36,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:36" (1/1) ... [2019-01-01 21:54:36,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:36" (1/1) ... [2019-01-01 21:54:36,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:54:36,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:54:36,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:54:36,797 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:54:36,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:54:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:54:36,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 21:54:36,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 21:54:36,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 21:54:36,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:54:36,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:54:37,304 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:54:37,305 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2019-01-01 21:54:37,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:54:37 BoogieIcfgContainer [2019-01-01 21:54:37,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:54:37,306 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:54:37,306 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:54:37,310 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:54:37,311 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:54:37,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:54:35" (1/3) ... [2019-01-01 21:54:37,313 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17adab1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:54:37, skipping insertion in model container [2019-01-01 21:54:37,313 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:54:37,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:36" (2/3) ... [2019-01-01 21:54:37,314 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17adab1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:54:37, skipping insertion in model container [2019-01-01 21:54:37,314 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:54:37,314 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:54:37" (3/3) ... [2019-01-01 21:54:37,316 INFO L375 chiAutomizerObserver]: Analyzing ICFG cll_traverse-alloca_false-termination.c.i [2019-01-01 21:54:37,375 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:54:37,376 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:54:37,376 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:54:37,376 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:54:37,377 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:54:37,377 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:54:37,377 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:54:37,377 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:54:37,377 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:54:37,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:54:37,411 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-01-01 21:54:37,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:37,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:37,418 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:54:37,419 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:54:37,419 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:54:37,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:54:37,420 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-01-01 21:54:37,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:37,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:37,421 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:54:37,421 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:54:37,430 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.allocOnHeap(12);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset;call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4);init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; 12#L552-3true [2019-01-01 21:54:37,431 INFO L796 eck$LassoCheckResult]: Loop: 12#L552-3true assume !!(init_cll_~i~0 < init_cll_~n);call init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset := #Ultimate.allocOnHeap(12);init_cll_~next_node~0.base, init_cll_~next_node~0.offset := init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset;call write~int(init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, 4);call write~$Pointer$(init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_~next_node~0.base, init_cll_~next_node~0.offset; 10#L552-2true init_cll_#t~post3 := init_cll_~i~0;init_cll_~i~0 := 1 + init_cll_#t~post3;havoc init_cll_#t~post3; 12#L552-3true [2019-01-01 21:54:37,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:37,438 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:54:37,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:37,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:37,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:37,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:37,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:37,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:37,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-01 21:54:37,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:37,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:37,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:37,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:37,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:37,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:37,626 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-01 21:54:37,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:37,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:37,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:37,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:37,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:38,363 WARN L181 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-01-01 21:54:38,404 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:38,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:38,654 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:38,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:38,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:38,904 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:156, output treesize:158 [2019-01-01 21:54:39,024 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-01 21:54:39,471 WARN L181 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-01-01 21:54:39,562 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:54:39,563 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:54:39,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:54:39,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:54:39,564 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:54:39,564 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:54:39,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:54:39,566 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:54:39,566 INFO L131 ssoRankerPreferences]: Filename of dumped script: cll_traverse-alloca_false-termination.c.i_Iteration1_Lasso [2019-01-01 21:54:39,566 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:54:39,566 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:54:39,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:39,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:39,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:39,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:39,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:39,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:39,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:39,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:39,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:39,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:39,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:39,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:39,894 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-01 21:54:40,187 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-01-01 21:54:40,654 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 21:54:40,933 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:54:40,939 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:54:40,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:40,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:40,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:40,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:40,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:40,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:40,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:40,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:40,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:40,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:40,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:40,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:40,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:40,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:40,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:40,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:40,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:40,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:40,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:40,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:40,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:40,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:40,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:40,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:40,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:40,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:40,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:40,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:40,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:40,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:40,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:40,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:40,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:40,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:40,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:40,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:40,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:40,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:40,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:40,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:40,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:40,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:40,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:40,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:40,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:40,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:40,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:40,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:40,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:40,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:40,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:40,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:40,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:40,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:40,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:40,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:40,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:40,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:40,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:40,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:40,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:40,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:40,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:40,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:41,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:41,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:41,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:41,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:41,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:41,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:41,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:41,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:41,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:41,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:41,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:41,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:41,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:41,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:41,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:41,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:41,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:41,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:41,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:41,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:41,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:41,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:41,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:41,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:41,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:41,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:41,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:41,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:41,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:41,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:41,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:41,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:41,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:41,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:41,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:41,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:41,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:41,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:41,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:41,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:41,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:41,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:41,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:41,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:41,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:41,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:41,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:41,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:41,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:41,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:41,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:41,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:41,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:41,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:41,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:41,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:41,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:41,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:41,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:41,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:41,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:41,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:41,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:41,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:41,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:41,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:41,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:41,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:41,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:41,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:41,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:41,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:41,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:41,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:41,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:41,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:41,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:41,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:41,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:41,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:41,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:41,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:41,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:41,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:41,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:41,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:41,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:41,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:41,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:41,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:41,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:41,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:41,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:41,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:41,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:41,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:41,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:41,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:41,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:41,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:41,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:41,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:41,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:41,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:41,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:41,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:41,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:41,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:41,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:41,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:41,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:41,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:41,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:41,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:41,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:41,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:41,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:41,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:41,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:41,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:41,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:41,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:41,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:41,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:41,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:41,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:41,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:41,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:41,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:41,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:41,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:41,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:41,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:41,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:41,250 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:54:41,282 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:54:41,283 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:54:41,285 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:54:41,287 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:54:41,288 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:54:41,290 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_cll_~n, ULTIMATE.start_init_cll_~i~0) = 1*ULTIMATE.start_init_cll_~n - 1*ULTIMATE.start_init_cll_~i~0 Supporting invariants [] [2019-01-01 21:54:41,352 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:54:41,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:41,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:41,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:54:41,467 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:54:41,469 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2019-01-01 21:54:41,518 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 27 states and 36 transitions. Complement of second has 7 states. [2019-01-01 21:54:41,521 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 [2019-01-01 21:54:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:54:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2019-01-01 21:54:41,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 21:54:41,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:41,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:54:41,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:41,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:54:41,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:41,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-01-01 21:54:41,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:54:41,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 8 states and 10 transitions. [2019-01-01 21:54:41,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:54:41,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:54:41,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-01-01 21:54:41,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:54:41,538 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-01 21:54:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-01-01 21:54:41,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-01 21:54:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:54:41,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-01 21:54:41,562 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-01 21:54:41,563 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-01 21:54:41,563 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:54:41,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-01-01 21:54:41,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:54:41,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:41,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:41,564 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:54:41,564 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:54:41,565 INFO L794 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 89#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.allocOnHeap(12);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset;call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4);init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; 90#L552-3 assume !(init_cll_~i~0 < init_cll_~n); 91#L552-4 call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8);init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; 92#L559 main_#t~ret7.base, main_#t~ret7.offset := init_cll_#res.base, init_cll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset;havoc traverse_#t~mem5.base, traverse_#t~mem5.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset;traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset;traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; 94#L564-2 [2019-01-01 21:54:41,565 INFO L796 eck$LassoCheckResult]: Loop: 94#L564-2 assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0);call traverse_#t~mem5.base, traverse_#t~mem5.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8);traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem5.base, traverse_#t~mem5.offset;havoc traverse_#t~mem5.base, traverse_#t~mem5.offset; 94#L564-2 [2019-01-01 21:54:41,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:41,565 INFO L82 PathProgramCache]: Analyzing trace with hash 28696935, now seen corresponding path program 1 times [2019-01-01 21:54:41,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:41,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:41,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:41,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:41,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:41,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:41,593 INFO L82 PathProgramCache]: Analyzing trace with hash 58, now seen corresponding path program 1 times [2019-01-01 21:54:41,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:41,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:41,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:41,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:41,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:41,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:41,603 INFO L82 PathProgramCache]: Analyzing trace with hash 889605012, now seen corresponding path program 1 times [2019-01-01 21:54:41,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:41,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:41,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:41,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:41,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:42,414 WARN L181 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 109 [2019-01-01 21:54:42,420 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:42,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:42,771 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:42,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:42,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:42,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:180, output treesize:156 [2019-01-01 21:54:43,026 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-01-01 21:54:43,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:54:43 BoogieIcfgContainer [2019-01-01 21:54:43,064 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:54:43,064 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:54:43,064 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:54:43,065 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:54:43,065 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:54:37" (3/4) ... [2019-01-01 21:54:43,070 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 21:54:43,126 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 21:54:43,127 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:54:43,128 INFO L168 Benchmark]: Toolchain (without parser) took 7145.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:43,130 INFO L168 Benchmark]: CDTParser took 0.16 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. [2019-01-01 21:54:43,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 688.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:43,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:54:43,133 INFO L168 Benchmark]: Boogie Preprocessor took 47.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:54:43,134 INFO L168 Benchmark]: RCFGBuilder took 509.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:43,135 INFO L168 Benchmark]: BuchiAutomizer took 5757.51 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -32.0 MB). Peak memory consumption was 303.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:43,138 INFO L168 Benchmark]: Witness Printer took 62.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:54:43,146 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.16 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 688.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 509.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5757.51 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -32.0 MB). Peak memory consumption was 303.0 MB. Max. memory is 11.5 GB. * Witness Printer took 62.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. The remainder module has 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 9 SDslu, 14 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital260 mio100 ax100 hnf100 lsp97 ukn43 mio100 lsp25 div100 bol100 ite100 ukn100 eq185 hnf92 smp100 dnf170 smp100 tf100 neg95 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 564]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=-2} State at position 1 is {i=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@77b6b184=0, \result=0, NULL=-2, next_node=0, \result=-1, next_node=0, head=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f519f76=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@77b6b184=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@423b4708=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@2a8a0eb0=0, head=0, head=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@202d8f88=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@202d8f88=0, curr=0, \old(n)=0, n=0, head=-1, n=0, head=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@227875da=0, head=0, head=-1, curr=-1, NULL=0, curr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@227875da=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@423b4708=0, curr=-1, head=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 564]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L570] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] curr->next = head [L559] return head; [L571] node_t* head = init_cll(n); [L563] node_t* curr = head; Loop: [L564] COND TRUE curr != ((void *)0) [L565] EXPR curr->next [L565] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...