./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strcspn_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-libowfat/strcspn_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 eaca3e09b762fe94634aa0b3e6a04213782212a5 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:17:58,826 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:17:58,828 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:17:58,841 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:17:58,841 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:17:58,842 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:17:58,844 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:17:58,846 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:17:58,847 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:17:58,848 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:17:58,849 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:17:58,850 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:17:58,851 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:17:58,852 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:17:58,853 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:17:58,854 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:17:58,855 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:17:58,857 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:17:58,859 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:17:58,861 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:17:58,862 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:17:58,863 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:17:58,866 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:17:58,866 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:17:58,867 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:17:58,868 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:17:58,869 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:17:58,870 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:17:58,870 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:17:58,872 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:17:58,872 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:17:58,873 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:17:58,873 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:17:58,873 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:17:58,875 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:17:58,875 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:17:58,876 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:17:58,902 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:17:58,903 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:17:58,904 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:17:58,904 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:17:58,905 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:17:58,905 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:17:58,905 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:17:58,905 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:17:58,905 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:17:58,906 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:17:58,906 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:17:58,906 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:17:58,906 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:17:58,906 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:17:58,906 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:17:58,908 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:17:58,908 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:17:58,908 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:17:58,908 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:17:58,909 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:17:58,909 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:17:58,909 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:17:58,909 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:17:58,909 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:17:58,909 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:17:58,911 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:17:58,911 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:17:58,911 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:17:58,912 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:17:58,913 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 -> eaca3e09b762fe94634aa0b3e6a04213782212a5 [2018-11-28 23:17:58,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:17:58,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:17:58,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:17:58,974 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:17:58,975 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:17:58,975 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strcspn_true-termination.c.i [2018-11-28 23:17:59,042 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25d2a77db/c552887e7abe4e95a965701db389f119/FLAGa71bed32e [2018-11-28 23:17:59,622 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:17:59,623 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strcspn_true-termination.c.i [2018-11-28 23:17:59,635 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25d2a77db/c552887e7abe4e95a965701db389f119/FLAGa71bed32e [2018-11-28 23:17:59,884 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25d2a77db/c552887e7abe4e95a965701db389f119 [2018-11-28 23:17:59,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:17:59,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:17:59,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:17:59,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:17:59,895 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:17:59,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:17:59" (1/1) ... [2018-11-28 23:17:59,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dac0250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:59, skipping insertion in model container [2018-11-28 23:17:59,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:17:59" (1/1) ... [2018-11-28 23:17:59,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:17:59,957 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:18:00,330 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:00,342 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:18:00,403 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:00,557 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:18:00,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:00 WrapperNode [2018-11-28 23:18:00,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:00,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:00,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:18:00,559 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:18:00,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:00" (1/1) ... [2018-11-28 23:18:00,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:00" (1/1) ... [2018-11-28 23:18:00,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:00,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:18:00,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:18:00,626 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:18:00,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:00" (1/1) ... [2018-11-28 23:18:00,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:00" (1/1) ... [2018-11-28 23:18:00,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:00" (1/1) ... [2018-11-28 23:18:00,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:00" (1/1) ... [2018-11-28 23:18:00,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:00" (1/1) ... [2018-11-28 23:18:00,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:00" (1/1) ... [2018-11-28 23:18:00,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:00" (1/1) ... [2018-11-28 23:18:00,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:18:00,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:18:00,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:18:00,671 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:18:00,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:00,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:18:00,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:18:00,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:18:00,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:18:00,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:18:00,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:18:01,195 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:18:01,195 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:18:01,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:01 BoogieIcfgContainer [2018-11-28 23:18:01,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:18:01,197 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:18:01,197 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:18:01,201 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:18:01,202 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:01,203 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:17:59" (1/3) ... [2018-11-28 23:18:01,204 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e6e2b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:01, skipping insertion in model container [2018-11-28 23:18:01,204 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:01,204 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:00" (2/3) ... [2018-11-28 23:18:01,205 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e6e2b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:01, skipping insertion in model container [2018-11-28 23:18:01,206 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:01,206 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:01" (3/3) ... [2018-11-28 23:18:01,208 INFO L375 chiAutomizerObserver]: Analyzing ICFG strcspn_true-termination.c.i [2018-11-28 23:18:01,267 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:18:01,268 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:18:01,268 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:18:01,268 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:18:01,269 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:18:01,269 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:18:01,269 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:18:01,269 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:18:01,269 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:18:01,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 23:18:01,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:18:01,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:01,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:01,316 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:18:01,316 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:18:01,317 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:18:01,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 23:18:01,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:18:01,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:01,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:01,319 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:18:01,319 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:18:01,329 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 12#L519true assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 6#L523true assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 18#L510-4true [2018-11-28 23:18:01,330 INFO L796 eck$LassoCheckResult]: Loop: 18#L510-4true call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 11#L510-1true assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 15#L511-4true assume !true; 19#L511-5true strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 16#L510-3true strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 18#L510-4true [2018-11-28 23:18:01,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:01,341 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-28 23:18:01,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:01,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:01,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:01,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:01,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:01,518 INFO L82 PathProgramCache]: Analyzing trace with hash 44069891, now seen corresponding path program 1 times [2018-11-28 23:18:01,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:01,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:01,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:01,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:01,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:18:01,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:18:01,558 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:18:01,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:18:01,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:18:01,584 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-11-28 23:18:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:18:01,592 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-28 23:18:01,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:18:01,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-28 23:18:01,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:18:01,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 13 transitions. [2018-11-28 23:18:01,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:18:01,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:18:01,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2018-11-28 23:18:01,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:01,603 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-28 23:18:01,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2018-11-28 23:18:01,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-28 23:18:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:18:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-28 23:18:01,631 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-28 23:18:01,631 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-28 23:18:01,631 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:18:01,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2018-11-28 23:18:01,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:18:01,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:01,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:01,633 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:18:01,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:01,633 INFO L794 eck$LassoCheckResult]: Stem: 47#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 43#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 50#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 53#L510-4 [2018-11-28 23:18:01,634 INFO L796 eck$LassoCheckResult]: Loop: 53#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 48#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 49#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 44#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 45#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 52#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 53#L510-4 [2018-11-28 23:18:01,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:01,634 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-11-28 23:18:01,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:01,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:01,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:01,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:01,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:01,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1365737035, now seen corresponding path program 1 times [2018-11-28 23:18:01,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:01,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:01,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:01,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:01,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:01,694 INFO L82 PathProgramCache]: Analyzing trace with hash 736220402, now seen corresponding path program 1 times [2018-11-28 23:18:01,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:01,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:01,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:01,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:01,943 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-28 23:18:02,186 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:18:02,938 WARN L180 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-11-28 23:18:03,182 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-28 23:18:03,197 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:03,199 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:03,199 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:03,199 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:03,200 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:03,200 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:03,200 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:03,200 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:03,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:18:03,201 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:03,202 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:03,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,844 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2018-11-28 23:18:04,005 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-11-28 23:18:04,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,744 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-28 23:18:04,801 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:04,807 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:04,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:04,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:04,813 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:04,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:04,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:04,822 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:04,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:04,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:04,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:04,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:04,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:04,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:04,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:04,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:04,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:04,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:04,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:04,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:04,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:04,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:04,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:04,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:04,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:04,962 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:04,993 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:18:04,993 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:18:04,996 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:04,998 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:04,998 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:04,999 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1, ULTIMATE.start_strcspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 - 1*ULTIMATE.start_strcspn_~s.offset Supporting invariants [] [2018-11-28 23:18:05,114 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-28 23:18:05,123 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:05,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:05,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:05,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:05,330 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:18:05,331 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-11-28 23:18:05,469 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 20 states and 23 transitions. Complement of second has 5 states. [2018-11-28 23:18:05,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:05,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-28 23:18:05,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 23:18:05,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:05,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 23:18:05,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:05,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-28 23:18:05,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:05,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-28 23:18:05,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:05,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 21 transitions. [2018-11-28 23:18:05,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:18:05,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:18:05,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-28 23:18:05,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:05,480 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 23:18:05,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-28 23:18:05,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-28 23:18:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 23:18:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-28 23:18:05,482 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 23:18:05,482 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 23:18:05,482 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:18:05,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-11-28 23:18:05,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:05,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:05,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:05,484 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:05,484 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:05,485 INFO L794 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 192#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 193#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 204#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 207#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 200#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 201#L511-4 [2018-11-28 23:18:05,485 INFO L796 eck$LassoCheckResult]: Loop: 201#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 194#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 195#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 205#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 201#L511-4 [2018-11-28 23:18:05,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:05,485 INFO L82 PathProgramCache]: Analyzing trace with hash 889571309, now seen corresponding path program 1 times [2018-11-28 23:18:05,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:05,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:05,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:05,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:05,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:05,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:05,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 1 times [2018-11-28 23:18:05,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:05,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:05,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:05,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:05,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:05,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:05,541 INFO L82 PathProgramCache]: Analyzing trace with hash 736222132, now seen corresponding path program 1 times [2018-11-28 23:18:05,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:05,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:05,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:05,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:05,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:05,773 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 23:18:06,248 WARN L180 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-11-28 23:18:06,367 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-11-28 23:18:06,371 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:06,371 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:06,371 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:06,371 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:06,371 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:06,372 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:06,372 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:06,372 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:06,372 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:18:06,372 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:06,372 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:06,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,850 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-11-28 23:18:06,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:07,589 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:07,590 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:07,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:07,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:07,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:07,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:07,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:07,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:07,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:07,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:07,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:07,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:07,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:07,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,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 [2018-11-28 23:18:07,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:07,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:07,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:07,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:07,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:07,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:07,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:07,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:07,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:07,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:07,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:07,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:07,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,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 [2018-11-28 23:18:07,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:07,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,646 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:07,647 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-28 23:18:07,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,660 INFO L402 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2018-11-28 23:18:07,660 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-28 23:18:07,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:07,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:07,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,775 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:07,798 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:18:07,798 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:18:07,798 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:07,799 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:07,800 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:07,800 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~reject.offset, ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_2) = -1*ULTIMATE.start_strcspn_~reject.offset - 1*ULTIMATE.start_strcspn_~i~0 + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_2 Supporting invariants [] [2018-11-28 23:18:07,909 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-28 23:18:07,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:07,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:07,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:07,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:08,072 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:18:08,073 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:18:08,099 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 45 states and 51 transitions. Complement of second has 5 states. [2018-11-28 23:18:08,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:18:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-28 23:18:08,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:18:08,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:08,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 23:18:08,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:08,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 23:18:08,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:08,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2018-11-28 23:18:08,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:08,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 33 transitions. [2018-11-28 23:18:08,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:18:08,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:18:08,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2018-11-28 23:18:08,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:08,107 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-28 23:18:08,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2018-11-28 23:18:08,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-28 23:18:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:18:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-28 23:18:08,110 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 23:18:08,110 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 23:18:08,110 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:18:08,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-11-28 23:18:08,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:08,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:08,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:08,111 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:08,112 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:08,112 INFO L794 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 370#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 371#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 381#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 384#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 379#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 380#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 393#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 392#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 387#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 388#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 377#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 378#L511-4 [2018-11-28 23:18:08,112 INFO L796 eck$LassoCheckResult]: Loop: 378#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 372#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 373#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 382#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 378#L511-4 [2018-11-28 23:18:08,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:08,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1161797001, now seen corresponding path program 2 times [2018-11-28 23:18:08,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:08,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:08,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:08,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:08,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:08,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:08,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 2 times [2018-11-28 23:18:08,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:08,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:08,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:08,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:08,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:08,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:08,170 INFO L82 PathProgramCache]: Analyzing trace with hash -967302850, now seen corresponding path program 1 times [2018-11-28 23:18:08,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:08,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:08,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:08,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:08,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:08,473 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2018-11-28 23:18:08,704 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 10 [2018-11-28 23:18:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:08,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:18:08,706 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 [2018-11-28 23:18:08,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:08,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:09,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 23:18:09,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 3 [2018-11-28 23:18:09,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:09,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:09,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:09,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-28 23:18:09,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:09,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:18:09,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-28 23:18:09,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:18:09,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:18:09,196 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 13 states. [2018-11-28 23:18:09,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:18:09,340 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-28 23:18:09,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:18:09,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 51 transitions. [2018-11-28 23:18:09,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:09,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 39 transitions. [2018-11-28 23:18:09,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:18:09,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:18:09,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2018-11-28 23:18:09,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:09,346 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-28 23:18:09,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2018-11-28 23:18:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-11-28 23:18:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:18:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-28 23:18:09,351 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-28 23:18:09,351 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-28 23:18:09,351 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:18:09,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2018-11-28 23:18:09,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:09,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:09,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:09,355 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:09,355 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:09,355 INFO L794 eck$LassoCheckResult]: Stem: 513#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 507#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 508#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 518#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 522#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 516#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 517#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 511#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 512#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 520#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 521#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 527#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 526#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 523#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 524#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 514#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 515#L511-4 [2018-11-28 23:18:09,355 INFO L796 eck$LassoCheckResult]: Loop: 515#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 509#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 510#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 519#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 515#L511-4 [2018-11-28 23:18:09,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:09,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1375356158, now seen corresponding path program 2 times [2018-11-28 23:18:09,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:09,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:09,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:09,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:09,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:09,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:09,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 3 times [2018-11-28 23:18:09,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:09,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:09,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:09,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:09,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:09,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:09,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1858115515, now seen corresponding path program 3 times [2018-11-28 23:18:09,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:09,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:09,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:09,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:09,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:09,557 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 23:18:10,278 WARN L180 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 138 [2018-11-28 23:18:10,480 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-11-28 23:18:10,483 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:10,483 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:10,484 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:10,484 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:10,484 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:10,484 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:10,484 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:10,484 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:10,484 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration5_Lasso [2018-11-28 23:18:10,484 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:10,484 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:10,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,095 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2018-11-28 23:18:11,344 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-11-28 23:18:11,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,680 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2018-11-28 23:18:12,419 WARN L180 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-11-28 23:18:12,634 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:12,635 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:12,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:12,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:12,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:12,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:12,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,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 [2018-11-28 23:18:12,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:12,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:12,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:12,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:12,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:12,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:12,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:12,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:12,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:12,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:12,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:12,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:12,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:12,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:12,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:12,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:12,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:12,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:12,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:12,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:12,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:12,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:12,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:12,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:12,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:12,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:12,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:12,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:12,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:12,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:12,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:12,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:12,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:12,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:12,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:12,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:12,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:12,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:12,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,745 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:12,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,747 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:12,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,761 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-28 23:18:12,761 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-28 23:18:12,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,776 INFO L402 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2018-11-28 23:18:12,777 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-28 23:18:12,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:12,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:12,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,899 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:12,965 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:18:12,965 INFO L444 ModelExtractionUtils]: 40 out of 49 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 23:18:12,966 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:12,967 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:12,967 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:12,967 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3, ULTIMATE.start_strcspn_~i~0) = 3*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3 - 2*ULTIMATE.start_strcspn_~i~0 Supporting invariants [] [2018-11-28 23:18:13,752 INFO L297 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2018-11-28 23:18:13,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:13,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:13,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:13,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:13,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:13,915 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-28 23:18:13,915 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-28 23:18:14,000 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 27 states and 30 transitions. Complement of second has 5 states. [2018-11-28 23:18:14,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:18:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-11-28 23:18:14,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-28 23:18:14,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:14,003 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:18:14,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:14,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:14,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:14,178 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-28 23:18:14,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-28 23:18:14,230 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 27 states and 30 transitions. Complement of second has 5 states. [2018-11-28 23:18:14,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:18:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-11-28 23:18:14,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-28 23:18:14,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:14,232 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:18:14,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:14,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:14,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:14,445 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-28 23:18:14,446 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-28 23:18:14,616 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 56 states and 63 transitions. Complement of second has 11 states. [2018-11-28 23:18:14,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-28 23:18:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:18:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2018-11-28 23:18:14,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-28 23:18:14,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:14,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-28 23:18:14,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:14,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-28 23:18:14,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:14,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 63 transitions. [2018-11-28 23:18:14,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:14,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 42 states and 46 transitions. [2018-11-28 23:18:14,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:18:14,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:18:14,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2018-11-28 23:18:14,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:14,626 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-28 23:18:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2018-11-28 23:18:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-11-28 23:18:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 23:18:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-28 23:18:14,632 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-28 23:18:14,633 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-28 23:18:14,633 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:18:14,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2018-11-28 23:18:14,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:14,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:14,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:14,637 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-28 23:18:14,637 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:14,637 INFO L794 eck$LassoCheckResult]: Stem: 1044#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1038#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 1039#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 1049#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 1053#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1058#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1069#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1066#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1068#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 1067#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1065#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1064#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1063#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1054#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1055#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1047#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1048#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1042#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1043#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 1051#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1052#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1070#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1059#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1060#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1061#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1045#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1046#L511-4 [2018-11-28 23:18:14,637 INFO L796 eck$LassoCheckResult]: Loop: 1046#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1040#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1041#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 1050#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1046#L511-4 [2018-11-28 23:18:14,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:14,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1550213327, now seen corresponding path program 4 times [2018-11-28 23:18:14,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:14,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:14,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:14,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:14,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:14,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 4 times [2018-11-28 23:18:14,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:14,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:14,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:14,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:14,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:14,696 INFO L82 PathProgramCache]: Analyzing trace with hash 229061526, now seen corresponding path program 5 times [2018-11-28 23:18:14,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:14,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:14,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:14,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:15,679 WARN L180 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 171 [2018-11-28 23:18:15,883 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-28 23:18:15,885 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:15,885 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:15,885 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:15,886 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:15,886 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:15,886 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:15,886 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:15,886 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:15,886 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration6_Lasso [2018-11-28 23:18:15,886 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:15,886 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:15,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,465 WARN L180 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-11-28 23:18:16,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,883 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-11-28 23:18:17,170 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 23:18:19,012 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2018-11-28 23:18:19,088 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:19,089 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:19,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:19,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:19,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:19,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:19,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:19,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:19,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:19,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:19,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:19,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:19,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:19,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:19,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:19,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:19,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:19,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:19,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 [2018-11-28 23:18:19,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:19,109 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:19,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:19,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:19,114 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:19,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:19,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:19,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:19,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:19,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:19,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:19,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:19,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:19,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:19,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:19,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 [2018-11-28 23:18:19,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:19,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:19,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:19,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:19,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:19,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:19,165 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:19,186 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:18:19,186 INFO L444 ModelExtractionUtils]: 39 out of 49 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 23:18:19,187 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:19,187 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:19,188 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:19,189 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, ULTIMATE.start_strcspn_~reject.offset, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4) = -1*ULTIMATE.start_strcspn_~i~0 - 1*ULTIMATE.start_strcspn_~reject.offset + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4 Supporting invariants [] [2018-11-28 23:18:19,580 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2018-11-28 23:18:19,582 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:19,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:19,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:19,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:19,643 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:18:19,643 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:18:19,666 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 45 states and 50 transitions. Complement of second has 5 states. [2018-11-28 23:18:19,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:18:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-28 23:18:19,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-28 23:18:19,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:19,669 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:18:19,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:19,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:19,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:19,757 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:18:19,757 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:18:19,780 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 45 states and 50 transitions. Complement of second has 5 states. [2018-11-28 23:18:19,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:18:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-28 23:18:19,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-28 23:18:19,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:19,782 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:18:19,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:19,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:19,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:19,843 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:18:19,844 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:18:19,874 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 62 states and 71 transitions. Complement of second has 4 states. [2018-11-28 23:18:19,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:18:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-28 23:18:19,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-28 23:18:19,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:19,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 30 letters. Loop has 4 letters. [2018-11-28 23:18:19,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:19,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 26 letters. Loop has 8 letters. [2018-11-28 23:18:19,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:19,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 71 transitions. [2018-11-28 23:18:19,886 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:19,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 0 states and 0 transitions. [2018-11-28 23:18:19,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:18:19,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:18:19,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:18:19,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:19,886 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:19,886 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:19,887 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:19,887 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:18:19,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:18:19,887 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:19,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:18:19,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:18:19 BoogieIcfgContainer [2018-11-28 23:18:19,897 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:18:19,897 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:18:19,897 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:18:19,897 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:18:19,898 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:01" (3/4) ... [2018-11-28 23:18:19,901 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:18:19,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:18:19,903 INFO L168 Benchmark]: Toolchain (without parser) took 20014.08 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 368.6 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -65.3 MB). Peak memory consumption was 303.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:19,904 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:19,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:19,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:19,906 INFO L168 Benchmark]: Boogie Preprocessor took 43.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:19,906 INFO L168 Benchmark]: RCFGBuilder took 527.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:19,907 INFO L168 Benchmark]: BuchiAutomizer took 18700.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.1 MB). Peak memory consumption was 316.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:19,908 INFO L168 Benchmark]: Witness Printer took 4.66 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. [2018-11-28 23:18:19,913 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.17 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 667.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 527.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18700.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.1 MB). Peak memory consumption was 316.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.66 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function -1 * reject + -1 * i + unknown-#length-unknown[reject] and consists of 3 locations. One nondeterministic module has affine ranking function 3 * unknown-#length-unknown[reject] + -2 * i and consists of 8 locations. One nondeterministic module has affine ranking function -1 * i + -1 * reject + unknown-#length-unknown[reject] and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.6s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 16.5s. Construction of modules took 0.3s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 114 SDtfs, 168 SDslu, 100 SDs, 0 SdLazy, 136 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital252 mio100 ax100 hnf99 lsp94 ukn78 mio100 lsp37 div100 bol100 ite100 ukn100 eq183 hnf89 smp96 dnf466 smp77 tf100 neg91 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 92ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 12 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 136 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...