./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 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-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-2e94e6a [2019-01-01 22:03:09,257 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:03:09,259 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:03:09,271 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:03:09,272 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:03:09,273 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:03:09,275 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:03:09,277 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:03:09,279 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:03:09,280 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:03:09,281 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:03:09,281 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:03:09,282 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:03:09,284 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:03:09,285 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:03:09,286 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:03:09,287 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:03:09,289 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:03:09,291 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:03:09,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:03:09,295 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:03:09,296 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:03:09,299 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:03:09,299 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:03:09,299 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:03:09,300 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:03:09,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:03:09,303 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:03:09,304 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:03:09,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:03:09,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:03:09,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:03:09,307 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:03:09,307 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:03:09,308 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:03:09,310 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:03:09,310 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:03:09,340 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:03:09,340 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:03:09,341 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:03:09,341 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:03:09,342 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:03:09,342 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:03:09,342 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:03:09,342 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:03:09,342 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:03:09,343 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:03:09,343 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:03:09,343 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:03:09,343 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:03:09,343 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:03:09,343 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:03:09,344 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:03:09,344 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:03:09,344 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:03:09,344 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:03:09,344 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:03:09,345 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:03:09,345 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:03:09,345 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:03:09,345 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:03:09,345 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:03:09,346 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:03:09,346 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:03:09,346 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:03:09,347 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:03:09,347 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-01 22:03:09,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:03:09,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:03:09,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:03:09,432 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:03:09,433 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:03:09,434 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i [2019-01-01 22:03:09,502 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c9f0ae1/ab7cabeccc5348c2acaadf062d05bf60/FLAG21c3d73bd [2019-01-01 22:03:10,021 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:03:10,021 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i [2019-01-01 22:03:10,035 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c9f0ae1/ab7cabeccc5348c2acaadf062d05bf60/FLAG21c3d73bd [2019-01-01 22:03:10,320 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c9f0ae1/ab7cabeccc5348c2acaadf062d05bf60 [2019-01-01 22:03:10,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:03:10,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:03:10,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:03:10,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:03:10,333 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:03:10,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:03:10" (1/1) ... [2019-01-01 22:03:10,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4fbf7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:10, skipping insertion in model container [2019-01-01 22:03:10,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:03:10" (1/1) ... [2019-01-01 22:03:10,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:03:10,402 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:03:10,844 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:03:10,862 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:03:10,997 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:03:11,083 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:03:11,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:11 WrapperNode [2019-01-01 22:03:11,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:03:11,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:03:11,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:03:11,086 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:03:11,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:11" (1/1) ... [2019-01-01 22:03:11,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:11" (1/1) ... [2019-01-01 22:03:11,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:03:11,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:03:11,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:03:11,144 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:03:11,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:11" (1/1) ... [2019-01-01 22:03:11,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:11" (1/1) ... [2019-01-01 22:03:11,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:11" (1/1) ... [2019-01-01 22:03:11,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:11" (1/1) ... [2019-01-01 22:03:11,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:11" (1/1) ... [2019-01-01 22:03:11,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:11" (1/1) ... [2019-01-01 22:03:11,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:11" (1/1) ... [2019-01-01 22:03:11,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:03:11,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:03:11,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:03:11,181 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:03:11,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:03:11,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:03:11,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:03:11,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:03:11,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:03:11,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:03:11,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:03:11,776 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:03:11,776 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 22:03:11,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:03:11 BoogieIcfgContainer [2019-01-01 22:03:11,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:03:11,778 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:03:11,779 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:03:11,783 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:03:11,784 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:03:11,784 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:03:10" (1/3) ... [2019-01-01 22:03:11,786 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a90e484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:03:11, skipping insertion in model container [2019-01-01 22:03:11,786 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:03:11,786 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:11" (2/3) ... [2019-01-01 22:03:11,787 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a90e484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:03:11, skipping insertion in model container [2019-01-01 22:03:11,787 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:03:11,788 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:03:11" (3/3) ... [2019-01-01 22:03:11,790 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_reverse_alloca_true-termination.c.i [2019-01-01 22:03:11,848 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:03:11,848 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:03:11,849 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:03:11,849 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:03:11,849 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:03:11,849 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:03:11,849 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:03:11,849 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:03:11,850 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:03:11,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:03:11,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 22:03:11,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:03:11,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:03:11,896 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:03:11,896 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:03:11,896 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:03:11,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:03:11,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 22:03:11,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:03:11,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:03:11,899 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:03:11,899 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:03:11,909 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-01 22:03:11,909 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-01 22:03:11,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:11,916 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-01 22:03:11,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:11,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:11,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:11,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:11,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:12,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:12,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-01-01 22:03:12,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:12,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:12,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:12,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:12,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:03:12,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:03:12,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:03:12,149 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:03:12,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 22:03:12,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 22:03:12,166 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-01 22:03:12,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:03:12,173 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-01 22:03:12,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 22:03:12,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-01 22:03:12,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 22:03:12,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-01-01 22:03:12,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 22:03:12,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 22:03:12,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-01 22:03:12,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:03:12,185 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 22:03:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-01 22:03:12,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-01 22:03:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 22:03:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-01 22:03:12,213 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 22:03:12,213 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 22:03:12,214 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:03:12,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-01 22:03:12,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 22:03:12,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:03:12,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:03:12,216 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:03:12,216 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:03:12,216 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-01 22:03:12,216 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~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209; 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-01 22:03:12,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:12,217 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-01 22:03:12,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:12,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:12,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:12,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:12,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:12,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:12,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-01-01 22:03:12,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:12,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:12,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:12,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:03:12,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:12,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:12,327 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-01-01 22:03:12,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:12,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:12,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:12,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:12,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:13,120 WARN L181 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-01-01 22:03:13,990 WARN L181 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-01-01 22:03:14,380 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-01-01 22:03:14,552 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-01 22:03:14,564 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:03:14,565 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:03:14,565 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:03:14,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:03:14,566 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:03:14,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:03:14,566 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:03:14,566 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:03:14,567 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 22:03:14,568 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:03:14,568 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:03:14,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:15,170 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-01-01 22:03:15,533 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-01-01 22:03:15,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:15,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:16,651 WARN L181 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-01 22:03:17,047 WARN L181 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-01-01 22:03:17,193 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:03:17,199 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:03:17,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:17,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:17,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:17,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:17,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:17,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:17,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:17,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:17,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:17,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:17,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:17,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:17,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:17,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:17,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:17,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:17,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:17,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:17,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:17,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:17,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:17,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:17,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:17,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:17,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:17,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:17,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:17,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:17,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:17,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:17,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:17,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:17,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:17,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:17,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:17,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:17,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:17,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:17,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:17,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:17,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:17,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:17,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:17,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:17,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:17,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,265 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:03:17,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,275 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:03:17,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:17,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,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-01 22:03:17,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:17,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:17,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:17,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,364 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2019-01-01 22:03:17,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,369 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:03:17,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:17,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:17,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:17,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:17,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,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-01 22:03:17,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:17,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:17,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:17,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:17,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:17,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:17,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:17,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:17,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:17,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:17,478 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:03:17,501 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:03:17,503 INFO L444 ModelExtractionUtils]: 49 out of 52 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:03:17,506 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:03:17,508 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:03:17,512 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:03:17,514 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-01 22:03:17,672 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-01 22:03:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:17,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:17,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:03:17,784 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:03:17,785 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 22:03:17,846 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-01 22:03:17,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:03:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:03:17,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-01 22:03:17,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-01 22:03:17,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:17,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-01-01 22:03:17,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:17,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-01-01 22:03:17,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:17,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-01 22:03:17,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:03:17,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-01-01 22:03:17,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 22:03:17,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 22:03:17,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-01 22:03:17,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:03:17,856 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 22:03:17,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-01 22:03:17,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-01 22:03:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 22:03:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-01 22:03:17,859 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 22:03:17,859 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 22:03:17,859 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:03:17,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-01 22:03:17,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:03:17,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:03:17,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:03:17,860 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:03:17,861 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:03:17,861 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-01 22:03:17,861 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~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;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-01 22:03:17,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:17,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-01-01 22:03:17,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:17,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:17,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:17,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:17,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:17,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:17,889 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-01-01 22:03:17,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:17,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:17,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:17,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:17,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:17,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:17,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-01-01 22:03:17,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:17,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:17,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:17,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:18,081 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-01-01 22:03:18,271 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-01 22:03:18,609 WARN L181 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2019-01-01 22:03:18,801 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-01-01 22:03:18,805 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:03:18,805 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:03:18,805 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:03:18,805 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:03:18,805 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:03:18,805 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:03:18,805 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:03:18,806 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:03:18,806 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 22:03:18,806 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:03:18,806 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:03:18,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,225 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-01-01 22:03:19,570 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-01-01 22:03:19,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,874 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 22:03:20,580 WARN L181 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 22:03:20,696 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 22:03:21,067 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-01 22:03:21,108 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:03:21,108 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:03:21,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:21,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:21,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:21,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:21,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:21,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:21,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:21,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:21,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:21,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:21,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:21,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:21,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:21,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:21,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:21,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:21,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:21,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:21,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:21,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:21,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:21,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:21,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:21,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:21,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:21,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:21,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:21,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:21,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:21,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:21,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:21,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:21,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:21,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:21,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:21,128 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:03:21,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:21,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:21,133 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:03:21,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:21,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:21,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:21,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:21,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:21,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:21,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:21,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:21,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:21,184 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:03:21,206 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:03:21,207 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 22:03:21,207 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:03:21,208 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:03:21,208 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:03:21,209 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-01 22:03:21,601 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-01-01 22:03:21,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:21,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:21,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:03:21,916 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:03:21,916 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 22:03:21,953 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-01 22:03:21,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:03:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:03:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-01 22:03:21,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 22:03:21,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:21,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-01 22:03:21,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:21,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-01 22:03:21,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:21,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-01-01 22:03:21,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:03:21,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-01-01 22:03:21,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 22:03:21,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:03:21,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-01-01 22:03:21,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:03:21,966 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-01-01 22:03:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-01-01 22:03:21,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-01 22:03:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 22:03:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-01 22:03:21,969 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 22:03:21,969 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 22:03:21,969 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:03:21,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-01 22:03:21,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:03:21,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:03:21,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:03:21,971 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:03:21,971 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:03:21,971 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~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209; 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-01 22:03:21,971 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~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;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-01 22:03:21,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:21,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-01-01 22:03:21,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:21,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:21,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:21,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:21,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:21,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:21,996 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-01-01 22:03:21,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:21,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:21,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:21,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:21,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:22,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:22,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2019-01-01 22:03:22,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:22,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:22,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:22,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:03:22,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:22,198 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-01 22:03:22,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:03:22,199 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-01 22:03:22,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:22,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:22,294 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-01 22:03:22,300 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-01 22:03:22,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:03:22,384 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-01 22:03:22,416 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-01 22:03:22,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 22:03:22,646 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-01 22:03:22,647 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 22:03:22,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:03:22,660 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-01 22:03:22,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-01 22:03:22,666 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:27, output treesize:15 [2019-01-01 22:03:23,024 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-01 22:03:23,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:03:23,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-01-01 22:03:23,277 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-01 22:03:23,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 22:03:23,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-01 22:03:23,279 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 11 states. [2019-01-01 22:03:23,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:03:23,670 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-01-01 22:03:23,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 22:03:23,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2019-01-01 22:03:23,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:03:23,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2019-01-01 22:03:23,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 22:03:23,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 22:03:23,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-01-01 22:03:23,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:03:23,676 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-01-01 22:03:23,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-01-01 22:03:23,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2019-01-01 22:03:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 22:03:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-01 22:03:23,681 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-01 22:03:23,681 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-01 22:03:23,681 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:03:23,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-01-01 22:03:23,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:03:23,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:03:23,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:03:23,683 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:03:23,683 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:03:23,683 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~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209; 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-01 22:03:23,683 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~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;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-01 22:03:23,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:23,684 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-01-01 22:03:23,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:23,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:23,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:23,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:23,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:23,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:23,711 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-01-01 22:03:23,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:23,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:23,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:23,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:03:23,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:23,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:23,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-01-01 22:03:23,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:23,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:23,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:23,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:03:23,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:23,935 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-01-01 22:03:24,081 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-01 22:03:24,771 WARN L181 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 136 [2019-01-01 22:03:25,940 WARN L181 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2019-01-01 22:03:25,948 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:03:25,948 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:03:25,948 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:03:25,948 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:03:25,948 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:03:25,948 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:03:25,948 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:03:25,949 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:03:25,949 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration5_Lasso [2019-01-01 22:03:25,949 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:03:25,949 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:03:25,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:25,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:25,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-01 22:03:25,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-01 22:03:25,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:25,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:25,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-01 22:03:25,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-01 22:03:26,251 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 22:03:27,188 WARN L181 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-01-01 22:03:27,385 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-01 22:03:27,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:27,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:27,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:27,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:27,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:27,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:27,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:27,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:27,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:27,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:27,795 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-01-01 22:03:28,806 WARN L181 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-01-01 22:03:29,015 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-01 22:03:29,474 WARN L181 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 22:03:29,614 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:03:29,614 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:03:29,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:29,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:29,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:29,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:29,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:29,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:29,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:29,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:29,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:29,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:29,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:29,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:29,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:29,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:29,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:29,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:29,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:29,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:29,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:29,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:29,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:29,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:29,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:29,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:29,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:29,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:29,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:29,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:29,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:29,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:29,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:29,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:29,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:29,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:29,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:29,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:29,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:29,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:29,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:29,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:29,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:29,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:29,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:29,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:29,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:29,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:29,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:29,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:29,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:29,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:29,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:29,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:29,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:29,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:29,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:29,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:29,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:29,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:29,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:29,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:29,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:29,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:29,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:29,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:29,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:29,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:29,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:29,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:29,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:29,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:29,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:29,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:29,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:29,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:29,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:29,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:29,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:29,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:29,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:29,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:29,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:29,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:29,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:29,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:29,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:29,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:29,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:29,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:29,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:29,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:29,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:29,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:29,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:29,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:29,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:29,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:29,690 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 22:03:29,690 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-01 22:03:29,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:29,733 INFO L402 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2019-01-01 22:03:29,733 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-01 22:03:29,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:29,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:29,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:29,916 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:03:29,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:29,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:29,923 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:03:29,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:29,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:29,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:29,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:29,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:29,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:29,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:29,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:29,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:29,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:29,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:29,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:29,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:29,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:29,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:29,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:29,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:29,987 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:03:30,002 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:03:30,003 INFO L444 ModelExtractionUtils]: 43 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 22:03:30,003 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:03:30,006 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:03:30,006 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:03:30,006 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-01 22:03:30,733 INFO L297 tatePredicateManager]: 28 out of 28 supporting invariants were superfluous and have been removed [2019-01-01 22:03:30,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:30,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:30,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:03:30,993 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:03:30,993 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-01 22:03:31,031 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-01 22:03:31,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:03:31,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:03:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-01 22:03:31,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 22:03:31,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:31,034 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:03:31,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:31,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:31,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:31,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:03:31,088 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-01 22:03:31,088 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-01 22:03:31,107 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-01 22:03:31,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:03:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:03:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-01 22:03:31,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 22:03:31,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:31,111 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:03:31,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:31,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:31,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:03:31,170 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-01 22:03:31,171 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-01 22:03:31,199 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-01 22:03:31,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:03:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:03:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-01-01 22:03:31,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 22:03:31,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:31,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-01 22:03:31,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:31,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-01 22:03:31,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:31,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2019-01-01 22:03:31,207 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:03:31,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2019-01-01 22:03:31,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:03:31,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:03:31,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:03:31,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:03:31,208 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:03:31,208 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:03:31,208 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:03:31,210 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:03:31,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:03:31,211 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:03:31,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:03:31,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:03:31 BoogieIcfgContainer [2019-01-01 22:03:31,220 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:03:31,222 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:03:31,222 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:03:31,222 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:03:31,224 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:03:11" (3/4) ... [2019-01-01 22:03:31,228 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:03:31,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:03:31,229 INFO L168 Benchmark]: Toolchain (without parser) took 20904.69 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 349.7 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -74.6 MB). Peak memory consumption was 275.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:03:31,231 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:03:31,232 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -132.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-01-01 22:03:31,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:03:31,234 INFO L168 Benchmark]: Boogie Preprocessor took 36.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:03:31,235 INFO L168 Benchmark]: RCFGBuilder took 596.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:03:31,235 INFO L168 Benchmark]: BuchiAutomizer took 19441.95 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 236.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.2 MB). Peak memory consumption was 268.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:03:31,238 INFO L168 Benchmark]: Witness Printer took 6.96 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:03:31,243 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 757.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -132.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 596.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19441.95 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 236.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.2 MB). Peak memory consumption was 268.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.96 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 17.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. 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.2s 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: 223ms 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...