./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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-15/cstrcspn_reverse_alloca_true-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 6e6bf2d6e706b2fafcc380eb0a4d60b5a7a1666b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:46:04,021 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:46:04,023 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:46:04,038 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:46:04,038 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:46:04,040 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:46:04,042 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:46:04,044 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:46:04,045 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:46:04,046 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:46:04,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:46:04,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:46:04,049 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:46:04,050 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:46:04,051 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:46:04,052 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:46:04,053 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:46:04,055 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:46:04,057 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:46:04,059 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:46:04,060 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:46:04,061 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:46:04,064 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:46:04,064 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:46:04,065 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:46:04,066 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:46:04,066 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:46:04,068 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:46:04,068 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:46:04,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:46:04,070 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:46:04,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:46:04,071 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:46:04,071 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:46:04,073 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:46:04,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:46:04,074 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:46:04,092 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:46:04,093 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:46:04,094 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:46:04,094 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:46:04,094 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:46:04,095 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:46:04,095 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:46:04,095 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:46:04,096 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:46:04,096 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:46:04,096 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:46:04,096 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:46:04,096 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:46:04,097 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:46:04,097 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:46:04,097 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:46:04,097 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:46:04,097 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:46:04,097 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:46:04,099 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:46:04,099 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:46:04,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:46:04,100 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:46:04,100 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:46:04,100 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:46:04,101 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:46:04,101 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:46:04,101 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:46:04,102 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:46:04,102 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 -> 6e6bf2d6e706b2fafcc380eb0a4d60b5a7a1666b [2019-01-14 02:46:04,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:46:04,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:46:04,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:46:04,163 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:46:04,164 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:46:04,165 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i [2019-01-14 02:46:04,227 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0684f632/188926e43dbb458fbdd359844d7d77be/FLAGde5c74165 [2019-01-14 02:46:04,773 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:46:04,774 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i [2019-01-14 02:46:04,784 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0684f632/188926e43dbb458fbdd359844d7d77be/FLAGde5c74165 [2019-01-14 02:46:05,086 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0684f632/188926e43dbb458fbdd359844d7d77be [2019-01-14 02:46:05,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:46:05,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:46:05,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:46:05,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:46:05,095 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:46:05,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:46:05" (1/1) ... [2019-01-14 02:46:05,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4023dc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:05, skipping insertion in model container [2019-01-14 02:46:05,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:46:05" (1/1) ... [2019-01-14 02:46:05,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:46:05,145 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:46:05,555 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:46:05,574 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:46:05,694 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:46:05,762 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:46:05,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:05 WrapperNode [2019-01-14 02:46:05,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:46:05,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:46:05,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:46:05,764 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:46:05,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:05" (1/1) ... [2019-01-14 02:46:05,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:05" (1/1) ... [2019-01-14 02:46:05,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:46:05,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:46:05,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:46:05,832 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:46:05,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:05" (1/1) ... [2019-01-14 02:46:05,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:05" (1/1) ... [2019-01-14 02:46:05,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:05" (1/1) ... [2019-01-14 02:46:05,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:05" (1/1) ... [2019-01-14 02:46:05,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:05" (1/1) ... [2019-01-14 02:46:05,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:05" (1/1) ... [2019-01-14 02:46:05,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:05" (1/1) ... [2019-01-14 02:46:05,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:46:05,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:46:05,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:46:05,889 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:46:05,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:05" (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-14 02:46:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:46:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:46:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:46:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:46:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:46:05,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:46:06,450 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:46:06,450 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:46:06,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:46:06 BoogieIcfgContainer [2019-01-14 02:46:06,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:46:06,452 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:46:06,452 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:46:06,455 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:46:06,456 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:46:06,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:46:05" (1/3) ... [2019-01-14 02:46:06,457 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@916bb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:46:06, skipping insertion in model container [2019-01-14 02:46:06,457 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:46:06,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:05" (2/3) ... [2019-01-14 02:46:06,458 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@916bb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:46:06, skipping insertion in model container [2019-01-14 02:46:06,458 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:46:06,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:46:06" (3/3) ... [2019-01-14 02:46:06,460 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_reverse_alloca_true-termination.c.i [2019-01-14 02:46:06,514 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:46:06,514 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:46:06,514 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:46:06,515 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:46:06,515 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:46:06,515 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:46:06,515 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:46:06,515 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:46:06,515 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:46:06,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:46:06,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:46:06,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:06,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:06,560 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:46:06,561 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:46:06,561 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:46:06,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:46:06,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:46:06,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:06,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:06,564 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:46:06,564 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:46:06,572 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2019-01-14 02:46:06,573 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2019-01-14 02:46:06,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:06,584 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 02:46:06,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:06,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:06,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:06,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:06,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:06,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-01-14 02:46:06,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:06,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:06,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:06,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:06,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:06,784 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-14 02:46:06,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:46:06,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:46:06,790 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:46:06,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 02:46:06,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 02:46:06,805 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-14 02:46:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:46:06,812 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-14 02:46:06,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:46:06,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-14 02:46:06,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:46:06,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-01-14 02:46:06,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 02:46:06,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:46:06,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-14 02:46:06,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:46:06,823 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:46:06,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-14 02:46:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 02:46:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:46:06,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-14 02:46:06,851 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:46:06,851 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:46:06,851 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:46:06,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-14 02:46:06,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:46:06,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:06,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:06,853 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:46:06,853 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:46:06,854 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 47#L369-4 [2019-01-14 02:46:06,854 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2019-01-14 02:46:06,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:06,855 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-14 02:46:06,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:06,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:06,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:06,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:06,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:06,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:06,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-01-14 02:46:06,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:06,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:06,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:06,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:46:06,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:06,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:06,985 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-01-14 02:46:06,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:06,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:06,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:06,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:06,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:07,709 WARN L181 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-01-14 02:46:08,464 WARN L181 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-01-14 02:46:08,807 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-01-14 02:46:08,966 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-14 02:46:08,979 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:46:08,980 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:46:08,980 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:46:08,980 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:46:08,981 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:46:08,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:46:08,982 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:46:08,982 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:46:08,982 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:46:08,982 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:46:08,983 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:46:09,008 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-14 02:46:09,018 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-14 02:46:09,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:09,036 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-14 02:46:09,044 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-14 02:46:09,046 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-14 02:46:09,050 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-14 02:46:09,054 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-14 02:46:09,059 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-14 02:46:09,062 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-14 02:46:09,063 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-14 02:46:09,068 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-14 02:46:09,071 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-14 02:46:09,074 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-14 02:46:09,081 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-14 02:46:09,090 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-14 02:46:09,460 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-01-14 02:46:09,804 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-01-14 02:46:09,804 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-14 02:46:09,808 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-14 02:46:10,777 WARN L181 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-14 02:46:11,123 WARN L181 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-01-14 02:46:11,261 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:46:11,266 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:46:11,269 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-14 02:46:11,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:11,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:11,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:11,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,277 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-14 02:46:11,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:11,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:11,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,285 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-14 02:46:11,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:11,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:11,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:11,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,288 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-14 02:46:11,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:11,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:11,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,295 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-14 02:46:11,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:11,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:11,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:11,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,298 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-14 02:46:11,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:11,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:11,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:11,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,301 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-14 02:46:11,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:11,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:11,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:11,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,304 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-14 02:46:11,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:11,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:11,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:11,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,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 [2019-01-14 02:46:11,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:11,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:11,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:11,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,309 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-14 02:46:11,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:11,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:11,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:11,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,312 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-14 02:46:11,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:11,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:11,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:11,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,315 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-14 02:46:11,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:11,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:11,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:11,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,318 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-14 02:46:11,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:11,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:11,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:11,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,320 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-14 02:46:11,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:11,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:11,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:11,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,323 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-14 02:46:11,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:11,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:11,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:11,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,327 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-14 02:46:11,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:11,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:11,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,333 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-14 02:46:11,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,334 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:46:11,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,343 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:46:11,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:11,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,429 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-14 02:46:11,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:11,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:11,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,440 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-14 02:46:11,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:11,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,441 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2019-01-14 02:46:11,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,444 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:46:11,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:11,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,475 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-14 02:46:11,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:11,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:11,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:11,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,485 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-14 02:46:11,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:11,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:11,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:11,509 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-14 02:46:11,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:11,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:11,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:11,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:11,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:11,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:11,566 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:46:11,592 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:46:11,593 INFO L444 ModelExtractionUtils]: 49 out of 52 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:46:11,598 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:46:11,599 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:46:11,600 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:46:11,600 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset) = 2*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1 Supporting invariants [] [2019-01-14 02:46:11,769 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 02:46:11,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:11,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:11,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:11,852 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-14 02:46:11,855 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-14 02:46:11,856 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:46:11,933 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-01-14 02:46:11,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:46:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:46:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-14 02:46:11,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-14 02:46:11,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:11,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-01-14 02:46:11,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:11,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-01-14 02:46:11,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:11,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-14 02:46:11,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:46:11,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-01-14 02:46:11,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:46:11,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:46:11,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-14 02:46:11,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:46:11,942 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 02:46:11,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-14 02:46:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-14 02:46:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 02:46:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-14 02:46:11,945 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 02:46:11,945 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 02:46:11,945 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:46:11,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-14 02:46:11,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:46:11,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:11,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:11,947 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:46:11,947 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:46:11,947 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 177#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 179#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 189#L372-5 [2019-01-14 02:46:11,947 INFO L796 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 184#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 185#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 189#L372-5 [2019-01-14 02:46:11,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:11,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-01-14 02:46:11,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:11,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:11,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:11,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:11,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:11,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:11,976 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-01-14 02:46:11,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:11,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:11,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:11,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:11,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:11,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:11,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-01-14 02:46:11,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:11,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:11,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:11,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:11,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:12,533 WARN L181 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-01-14 02:46:12,679 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-14 02:46:13,009 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2019-01-14 02:46:13,191 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-01-14 02:46:13,196 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:46:13,196 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:46:13,196 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:46:13,196 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:46:13,197 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:46:13,197 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:46:13,197 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:46:13,197 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:46:13,197 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:46:13,197 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:46:13,197 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:46:13,203 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-14 02:46:13,217 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-14 02:46:13,619 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-01-14 02:46:13,967 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-01-14 02:46:13,967 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-14 02:46:13,969 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-14 02:46:13,970 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-14 02:46:13,972 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-14 02:46:13,974 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-14 02:46:13,977 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-14 02:46:13,979 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-14 02:46:13,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:13,985 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-14 02:46:13,986 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-14 02:46:13,988 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-14 02:46:13,991 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-14 02:46:13,993 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-14 02:46:13,995 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-14 02:46:13,997 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-14 02:46:14,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:14,896 WARN L181 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:46:15,308 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 02:46:15,346 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:46:15,346 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:46:15,347 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-14 02:46:15,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:15,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:15,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:15,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:15,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:15,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:15,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:15,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:15,352 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-14 02:46:15,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:15,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:15,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:15,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:15,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:15,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:15,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:15,360 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-14 02:46:15,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:15,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:15,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:15,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:15,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:15,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:15,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:15,370 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-14 02:46:15,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:15,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:15,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:15,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:15,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:15,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:15,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:15,376 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-14 02:46:15,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:15,379 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:46:15,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:15,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:15,384 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:46:15,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:15,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:15,405 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-14 02:46:15,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:15,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:15,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:15,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:15,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:15,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:15,437 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:46:15,459 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:46:15,460 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:46:15,460 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:46:15,461 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:46:15,462 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:46:15,462 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset) = 2*ULTIMATE.start_cstrcspn_~s~0.offset + 1 Supporting invariants [] [2019-01-14 02:46:15,846 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-01-14 02:46:16,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:16,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:16,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:16,331 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-14 02:46:16,331 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-14 02:46:16,331 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 02:46:16,496 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2019-01-14 02:46:16,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:46:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:46:16,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-14 02:46:16,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 02:46:16,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:16,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-14 02:46:16,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:16,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-14 02:46:16,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:16,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-01-14 02:46:16,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:46:16,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-01-14 02:46:16,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:46:16,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:46:16,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-01-14 02:46:16,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:46:16,510 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-01-14 02:46:16,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-01-14 02:46:16,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-14 02:46:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 02:46:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-14 02:46:16,517 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 02:46:16,517 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 02:46:16,517 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:46:16,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-14 02:46:16,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:46:16,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:16,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:16,522 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:46:16,522 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:46:16,522 INFO L794 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 354#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 355#L382 assume !(main_~length1~0 < 1); 356#L382-2 assume !(main_~length2~0 < 1); 353#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 349#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 350#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 363#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 359#L372-1 assume !cstrcspn_#t~short210; 360#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208; 345#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 346#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 347#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 348#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 352#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 362#L372-5 [2019-01-14 02:46:16,522 INFO L796 eck$LassoCheckResult]: Loop: 362#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 357#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 358#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 362#L372-5 [2019-01-14 02:46:16,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:16,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-01-14 02:46:16,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:16,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:16,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:16,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:16,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:16,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:16,560 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-01-14 02:46:16,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:16,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:16,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:16,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:16,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:16,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2019-01-14 02:46:16,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:16,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:16,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:16,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:46:16,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:46:16,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:46:16,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:46:16,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:17,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:17,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2019-01-14 02:46:17,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:46:17,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:46:17,291 INFO L303 Elim1Store]: Index analysis took 130 ms [2019-01-14 02:46:17,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2019-01-14 02:46:17,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 18 [2019-01-14 02:46:17,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:46:17,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2019-01-14 02:46:17,618 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:46:17,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:46:17,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:46:17,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 02:46:17,665 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:27, output treesize:15 [2019-01-14 02:46:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:46:18,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:46:18,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-01-14 02:46:18,200 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-01-14 02:46:18,398 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-14 02:46:18,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 02:46:18,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-14 02:46:18,400 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 11 states. [2019-01-14 02:46:18,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:46:18,693 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-01-14 02:46:18,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:46:18,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2019-01-14 02:46:18,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:46:18,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2019-01-14 02:46:18,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:46:18,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:46:18,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-01-14 02:46:18,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:46:18,701 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-01-14 02:46:18,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-01-14 02:46:18,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2019-01-14 02:46:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 02:46:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-14 02:46:18,705 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-14 02:46:18,706 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-14 02:46:18,706 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:46:18,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-01-14 02:46:18,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:46:18,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:18,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:18,707 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:46:18,708 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:46:18,708 INFO L794 eck$LassoCheckResult]: Stem: 517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 510#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 511#L382 assume !(main_~length1~0 < 1); 512#L382-2 assume !(main_~length2~0 < 1); 509#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 505#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 506#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 525#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 515#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 516#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208; 501#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 502#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 503#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 504#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 507#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 518#L372-5 [2019-01-14 02:46:18,708 INFO L796 eck$LassoCheckResult]: Loop: 518#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 513#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 514#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 518#L372-5 [2019-01-14 02:46:18,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:18,708 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-01-14 02:46:18,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:18,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:18,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:18,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:18,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:18,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:18,741 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-01-14 02:46:18,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:18,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:18,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:18,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:46:18,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:18,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:18,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-01-14 02:46:18,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:18,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:18,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:18,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:46:18,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:19,616 WARN L181 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-01-14 02:46:19,747 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-14 02:46:20,439 WARN L181 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 136 [2019-01-14 02:46:21,412 WARN L181 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2019-01-14 02:46:21,420 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:46:21,420 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:46:21,420 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:46:21,420 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:46:21,420 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:46:21,420 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:46:21,421 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:46:21,421 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:46:21,421 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration5_Lasso [2019-01-14 02:46:21,421 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:46:21,421 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:46:21,428 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-14 02:46:21,464 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-14 02:46:21,487 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-14 02:46:21,493 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-14 02:46:21,495 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-14 02:46:21,497 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-14 02:46:21,498 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-14 02:46:21,500 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-14 02:46:21,739 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:46:22,630 WARN L181 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-01-14 02:46:22,821 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-14 02:46:22,822 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-14 02:46:22,825 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-14 02:46:22,827 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-14 02:46:22,830 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-14 02:46:22,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:22,854 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-14 02:46:22,855 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-14 02:46:22,858 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-14 02:46:22,861 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-14 02:46:22,863 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-14 02:46:23,200 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-01-14 02:46:24,171 WARN L181 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-01-14 02:46:24,372 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 02:46:24,815 WARN L181 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:46:24,944 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 02:46:24,979 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:46:24,980 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:46:24,980 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-14 02:46:24,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:24,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:24,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:24,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:24,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:24,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:24,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:24,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:24,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-14 02:46:24,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:24,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:24,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:24,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:24,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:24,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:24,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:24,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:24,991 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-14 02:46:24,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:24,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:24,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:24,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:24,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:24,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:24,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:24,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:24,999 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-14 02:46:24,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:25,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:25,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:25,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:25,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:25,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:25,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:25,006 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-14 02:46:25,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:25,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:25,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:25,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:25,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:25,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:25,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:25,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:25,011 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-14 02:46:25,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:25,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:25,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:25,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:25,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:25,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:25,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:25,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:25,018 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-14 02:46:25,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:25,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:25,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:25,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:25,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:25,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:25,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:25,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:25,022 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-14 02:46:25,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:25,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:25,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:25,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:25,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:25,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:25,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:25,035 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-14 02:46:25,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:25,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:25,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:25,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:25,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:25,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:25,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:25,040 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-14 02:46:25,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:25,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:25,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:25,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:25,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:25,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:25,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:25,049 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-14 02:46:25,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:25,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:25,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:25,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:25,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:25,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:25,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:25,054 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-14 02:46:25,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:25,058 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:46:25,058 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-14 02:46:25,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:25,090 INFO L402 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2019-01-14 02:46:25,090 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-14 02:46:25,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:25,282 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-14 02:46:25,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:25,282 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:46:25,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:25,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:25,289 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:46:25,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:25,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:25,307 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-14 02:46:25,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:25,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:25,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:25,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:25,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:25,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:25,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:25,314 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-14 02:46:25,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:25,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:25,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:25,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:25,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:25,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:25,336 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:46:25,348 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:46:25,349 INFO L444 ModelExtractionUtils]: 43 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:46:25,349 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:46:25,350 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:46:25,350 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:46:25,350 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset) = 2*ULTIMATE.start_cstrcspn_~s~0.offset + 1 Supporting invariants [] [2019-01-14 02:46:26,081 INFO L297 tatePredicateManager]: 28 out of 28 supporting invariants were superfluous and have been removed [2019-01-14 02:46:26,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:26,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:26,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:26,138 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-14 02:46:26,139 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-14 02:46:26,139 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 02:46:26,166 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2019-01-14 02:46:26,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:46:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:46:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-14 02:46:26,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:46:26,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:26,170 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:46:26,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:26,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:26,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:26,241 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-14 02:46:26,242 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 [2019-01-14 02:46:26,242 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 02:46:26,259 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2019-01-14 02:46:26,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:46:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:46:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-14 02:46:26,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:46:26,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:26,261 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:46:26,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:26,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:26,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:26,308 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-14 02:46:26,309 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 [2019-01-14 02:46:26,309 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 02:46:26,328 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 45 states and 60 transitions. Complement of second has 4 states. [2019-01-14 02:46:26,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:46:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:46:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-01-14 02:46:26,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:46:26,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:26,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-14 02:46:26,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:26,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-14 02:46:26,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:26,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2019-01-14 02:46:26,338 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:46:26,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2019-01-14 02:46:26,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:46:26,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:46:26,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:46:26,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:46:26,340 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:46:26,340 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:46:26,340 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:46:26,340 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:46:26,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:46:26,340 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:46:26,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:46:26,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:46:26 BoogieIcfgContainer [2019-01-14 02:46:26,349 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:46:26,350 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:46:26,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:46:26,350 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:46:26,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:46:06" (3/4) ... [2019-01-14 02:46:26,358 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:46:26,362 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:46:26,363 INFO L168 Benchmark]: Toolchain (without parser) took 21272.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 359.7 MB). Free memory was 951.4 MB in the beginning and 965.4 MB in the end (delta: -14.1 MB). Peak memory consumption was 345.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:46:26,366 INFO L168 Benchmark]: CDTParser took 0.15 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-14 02:46:26,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:46:26,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.45 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-14 02:46:26,370 INFO L168 Benchmark]: Boogie Preprocessor took 56.63 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-14 02:46:26,371 INFO L168 Benchmark]: RCFGBuilder took 562.97 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:46:26,372 INFO L168 Benchmark]: BuchiAutomizer took 19897.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.7 MB). Free memory was 1.1 GB in the beginning and 965.4 MB in the end (delta: 124.0 MB). Peak memory consumption was 343.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:46:26,374 INFO L168 Benchmark]: Witness Printer took 12.07 ms. Allocated memory is still 1.4 GB. Free memory is still 965.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:46:26,383 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.15 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 671.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.45 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 56.63 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 562.97 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19897.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.7 MB). Free memory was 1.1 GB in the beginning and 965.4 MB in the end (delta: 124.0 MB). Peak memory consumption was 343.7 MB. Max. memory is 11.5 GB. * Witness Printer took 12.07 ms. Allocated memory is still 1.4 GB. Free memory is still 965.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * sc1 + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 18.3s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 117 SDtfs, 127 SDslu, 96 SDs, 0 SdLazy, 131 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital373 mio100 ax100 hnf99 lsp92 ukn73 mio100 lsp39 div115 bol100 ite100 ukn100 eq183 hnf83 smp91 dnf870 smp33 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 226ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...